./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:54:56,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:54:56,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:54:56,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:54:56,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:54:56,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:54:56,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:54:56,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:54:56,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:54:56,712 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:54:56,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:54:56,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:54:56,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:54:56,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:54:56,713 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:54:56,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:54:56,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:54:56,714 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:54:56,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:54:56,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:54:56,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:54:56,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:54:56,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:54:56,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:54:56,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:54:56,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:54:56,716 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 -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2025-03-17 11:54:56,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:54:56,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:54:56,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:54:56,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:54:56,949 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:54:56,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.0.i [2025-03-17 11:54:58,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f442a938a/ec47ec46e5394dd2be87132b65ed7193/FLAGb14872b52 [2025-03-17 11:54:58,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:54:58,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.0.i [2025-03-17 11:54:58,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f442a938a/ec47ec46e5394dd2be87132b65ed7193/FLAGb14872b52 [2025-03-17 11:54:58,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f442a938a/ec47ec46e5394dd2be87132b65ed7193 [2025-03-17 11:54:58,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:54:58,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:54:58,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:54:58,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:54:58,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:54:58,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:54:58" (1/1) ... [2025-03-17 11:54:58,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:58, skipping insertion in model container [2025-03-17 11:54:58,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:54:58" (1/1) ... [2025-03-17 11:54:58,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:54:58,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:54:58,950 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:54:58,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:54:59,015 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:54:59,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59 WrapperNode [2025-03-17 11:54:59,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:54:59,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:54:59,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:54:59,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:54:59,023 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:54:59" (1/1) ... [2025-03-17 11:54:59,032 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:54:59" (1/1) ... [2025-03-17 11:54:59,046 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2025-03-17 11:54:59,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:54:59,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:54:59,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:54:59,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:54:59,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,066 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-17 11:54:59,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:54:59,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:54:59,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:54:59,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:54:59,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (1/1) ... [2025-03-17 11:54:59,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:54:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:54:59,106 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:54:59,113 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:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:54:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:54:59,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:54:59,206 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:54:59,208 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:54:59,422 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-17 11:54:59,423 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:54:59,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:54:59,429 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:54:59,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:54:59 BoogieIcfgContainer [2025-03-17 11:54:59,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:54:59,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:54:59,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:54:59,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:54:59,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:54:58" (1/3) ... [2025-03-17 11:54:59,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782cd428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:54:59, skipping insertion in model container [2025-03-17 11:54:59,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:54:59" (2/3) ... [2025-03-17 11:54:59,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782cd428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:54:59, skipping insertion in model container [2025-03-17 11:54:59,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:54:59" (3/3) ... [2025-03-17 11:54:59,442 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2025-03-17 11:54:59,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:54:59,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.0.i that has 1 procedures, 60 locations, 1 initial locations, 2 loop locations, and 20 error locations. [2025-03-17 11:54:59,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:54:59,494 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;@3cba61f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:54:59,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-17 11:54:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 2.0) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 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:54:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 11:54:59,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:59,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 11:54:59,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:54:59,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 4336095, now seen corresponding path program 1 times [2025-03-17 11:54:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546684507] [2025-03-17 11:54:59,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:59,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 11:54:59,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 11:54:59,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:59,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546684507] [2025-03-17 11:54:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546684507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:59,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:54:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029733940] [2025-03-17 11:54:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:59,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:54:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:59,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:54:59,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:54:59,617 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 2.0) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:54:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:59,626 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2025-03-17 11:54:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:54:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 11:54:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:59,632 INFO L225 Difference]: With dead ends: 60 [2025-03-17 11:54:59,632 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 11:54:59,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:54:59,635 INFO L435 NwaCegarLoop]: 77 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, 77 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:54:59,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 11:54:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 11:54:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 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:54:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2025-03-17 11:54:59,658 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 4 [2025-03-17 11:54:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:59,659 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-03-17 11:54:59,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:54:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2025-03-17 11:54:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:54:59,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:59,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:54:59,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:54:59,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:54:59,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash -125675460, now seen corresponding path program 1 times [2025-03-17 11:54:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598944092] [2025-03-17 11:54:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:59,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:54:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:54:59,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:59,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598944092] [2025-03-17 11:54:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598944092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:54:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804999117] [2025-03-17 11:54:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:59,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:54:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:59,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:54:59,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:59,726 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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:54:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:59,787 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2025-03-17 11:54:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:54:59,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:54:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:59,788 INFO L225 Difference]: With dead ends: 108 [2025-03-17 11:54:59,788 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 11:54:59,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:59,789 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 61 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:59,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 11:54:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2025-03-17 11:54:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.955223880597015) internal successors, (131), 86 states have internal predecessors, (131), 0 states have call successors, (0), 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:54:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2025-03-17 11:54:59,798 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 6 [2025-03-17 11:54:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:59,798 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2025-03-17 11:54:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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:54:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2025-03-17 11:54:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:54:59,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:59,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:54:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:54:59,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:54:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash -125675109, now seen corresponding path program 1 times [2025-03-17 11:54:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-03-17 11:54:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:59,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:54:59,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:54:59,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:59,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149986370] [2025-03-17 11:54:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149986370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:59,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:59,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:54:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794921166] [2025-03-17 11:54:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:59,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:54:59,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:59,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:54:59,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:59,859 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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:54:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:54:59,883 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2025-03-17 11:54:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:54:59,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:54:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:54:59,884 INFO L225 Difference]: With dead ends: 161 [2025-03-17 11:54:59,884 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 11:54:59,884 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:54:59,885 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 59 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:54:59,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:54:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 11:54:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2025-03-17 11:54:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.9576271186440677) internal successors, (231), 137 states have internal predecessors, (231), 0 states have call successors, (0), 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:54:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 231 transitions. [2025-03-17 11:54:59,892 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 231 transitions. Word has length 6 [2025-03-17 11:54:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:54:59,893 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 231 transitions. [2025-03-17 11:54:59,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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:54:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 231 transitions. [2025-03-17 11:54:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:54:59,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:54:59,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:54:59,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:54:59,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:54:59,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:54:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 399114363, now seen corresponding path program 1 times [2025-03-17 11:54:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:54:59,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-17 11:54:59,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:54:59,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:54:59,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:54:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:54:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:54:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:54:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:54:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:54:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-17 11:54:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:54:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:54:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:54:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555727071] [2025-03-17 11:54:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:54:59,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:54:59,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:54:59,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:54:59,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:54:59,983 INFO L87 Difference]: Start difference. First operand 138 states and 231 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:00,057 INFO L93 Difference]: Finished difference Result 210 states and 334 transitions. [2025-03-17 11:55:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:55:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:00,059 INFO L225 Difference]: With dead ends: 210 [2025-03-17 11:55:00,059 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 11:55:00,059 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:55:00,060 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 66 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 163 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 11:55:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2025-03-17 11:55:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.8823529411764706) internal successors, (320), 187 states have internal predecessors, (320), 0 states have call successors, (0), 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:55:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 320 transitions. [2025-03-17 11:55:00,069 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 320 transitions. Word has length 7 [2025-03-17 11:55:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:00,069 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 320 transitions. [2025-03-17 11:55:00,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 320 transitions. [2025-03-17 11:55:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:55:00,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:00,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:00,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:55:00,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:00,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 399114364, now seen corresponding path program 1 times [2025-03-17 11:55:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-03-17 11:55:00,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:00,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:55:00,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:55:00,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-03-17 11:55:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911373916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917136166] [2025-03-17 11:55:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:00,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:00,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:00,182 INFO L87 Difference]: Start difference. First operand 188 states and 320 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:00,224 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2025-03-17 11:55:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:55:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:00,225 INFO L225 Difference]: With dead ends: 205 [2025-03-17 11:55:00,225 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 11:55:00,225 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:55:00,226 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 65 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:00,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 169 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 11:55:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2025-03-17 11:55:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 170 states have (on average 1.8352941176470587) internal successors, (312), 185 states have internal predecessors, (312), 0 states have call successors, (0), 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:55:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 312 transitions. [2025-03-17 11:55:00,235 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 312 transitions. Word has length 7 [2025-03-17 11:55:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 312 transitions. [2025-03-17 11:55:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 312 transitions. [2025-03-17 11:55:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:55:00,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:00,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:00,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:55:00,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:00,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -512354949, now seen corresponding path program 1 times [2025-03-17 11:55:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-03-17 11:55:00,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:00,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:55:00,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:55:00,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073072882] [2025-03-17 11:55:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073072882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:00,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619060982] [2025-03-17 11:55:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:00,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:00,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:00,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:00,289 INFO L87 Difference]: Start difference. First operand 186 states and 312 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:00,314 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2025-03-17 11:55:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:00,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:55:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:00,316 INFO L225 Difference]: With dead ends: 168 [2025-03-17 11:55:00,316 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 11:55:00,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:55:00,317 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 44 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:00,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 184 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 11:55:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2025-03-17 11:55:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 145 states have internal predecessors, (237), 0 states have call successors, (0), 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:55:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 237 transitions. [2025-03-17 11:55:00,326 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 237 transitions. Word has length 8 [2025-03-17 11:55:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:00,326 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 237 transitions. [2025-03-17 11:55:00,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 237 transitions. [2025-03-17 11:55:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:00,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:00,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:00,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:55:00,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1337908641, now seen corresponding path program 1 times [2025-03-17 11:55:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:00,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997652178] [2025-03-17 11:55:00,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:00,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:00,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:00,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:00,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997652178] [2025-03-17 11:55:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997652178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340651584] [2025-03-17 11:55:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:00,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:00,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:00,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:00,378 INFO L87 Difference]: Start difference. First operand 146 states and 237 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:00,400 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2025-03-17 11:55:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:55:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:00,401 INFO L225 Difference]: With dead ends: 225 [2025-03-17 11:55:00,401 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 11:55:00,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:55:00,403 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:00,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 179 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 11:55:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 210. [2025-03-17 11:55:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 198 states have (on average 1.6767676767676767) internal successors, (332), 209 states have internal predecessors, (332), 0 states have call successors, (0), 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:55:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 332 transitions. [2025-03-17 11:55:00,413 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 332 transitions. Word has length 9 [2025-03-17 11:55:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 332 transitions. [2025-03-17 11:55:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 332 transitions. [2025-03-17 11:55:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:55:00,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:00,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:00,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:55:00,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1699937716, now seen corresponding path program 1 times [2025-03-17 11:55:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-03-17 11:55:00,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:00,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:55:00,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:55:00,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-03-17 11:55:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777499349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029400829] [2025-03-17 11:55:00,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:00,486 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:55:00,488 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:55:00,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:55:00,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:55:00,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 11:55:00,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029400829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:00,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:00,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 11:55:00,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713150930] [2025-03-17 11:55:00,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:00,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:00,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:00,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:00,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:00,628 INFO L87 Difference]: Start difference. First operand 210 states and 332 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:00,665 INFO L93 Difference]: Finished difference Result 224 states and 332 transitions. [2025-03-17 11:55:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:00,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 11:55:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:00,667 INFO L225 Difference]: With dead ends: 224 [2025-03-17 11:55:00,667 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 11:55:00,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:00,667 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 133 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:00,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 320 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 11:55:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2025-03-17 11:55:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 215 states have internal predecessors, (330), 0 states have call successors, (0), 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:55:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 330 transitions. [2025-03-17 11:55:00,672 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 330 transitions. Word has length 14 [2025-03-17 11:55:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:00,672 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 330 transitions. [2025-03-17 11:55:00,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 330 transitions. [2025-03-17 11:55:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:55:00,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:00,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:00,680 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:55:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:00,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2133901004, now seen corresponding path program 1 times [2025-03-17 11:55:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408096059] [2025-03-17 11:55:00,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:00,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:55:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:55:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:00,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408096059] [2025-03-17 11:55:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408096059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:00,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726377688] [2025-03-17 11:55:00,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:00,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:00,923 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:55:00,924 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:55:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:55:00,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:55:00,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:00,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:00,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:55:00,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:01,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:01,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726377688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:01,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2025-03-17 11:55:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27763768] [2025-03-17 11:55:01,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:01,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:01,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:55:01,093 INFO L87 Difference]: Start difference. First operand 216 states and 330 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:01,233 INFO L93 Difference]: Finished difference Result 320 states and 453 transitions. [2025-03-17 11:55:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:01,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:55:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:01,235 INFO L225 Difference]: With dead ends: 320 [2025-03-17 11:55:01,235 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 11:55:01,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:55:01,236 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 147 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:01,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 463 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 11:55:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 301. [2025-03-17 11:55:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 289 states have (on average 1.480968858131488) internal successors, (428), 300 states have internal predecessors, (428), 0 states have call successors, (0), 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:55:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 428 transitions. [2025-03-17 11:55:01,244 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 428 transitions. Word has length 15 [2025-03-17 11:55:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:01,244 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 428 transitions. [2025-03-17 11:55:01,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 428 transitions. [2025-03-17 11:55:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:55:01,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:01,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:01,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:55:01,450 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,SelfDestructingSolverStorable8 [2025-03-17 11:55:01,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1974478824, now seen corresponding path program 1 times [2025-03-17 11:55:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927490027] [2025-03-17 11:55:01,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:01,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:55:01,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:55:01,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:01,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927490027] [2025-03-17 11:55:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927490027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913828913] [2025-03-17 11:55:01,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:01,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:01,524 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:55:01,525 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:55:01,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:55:01,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:55:01,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:01,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:01,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:55:01,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:01,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913828913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:01,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 11:55:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670563661] [2025-03-17 11:55:01,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:01,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:01,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:01,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:01,667 INFO L87 Difference]: Start difference. First operand 301 states and 428 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:01,726 INFO L93 Difference]: Finished difference Result 877 states and 1236 transitions. [2025-03-17 11:55:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:55:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:01,730 INFO L225 Difference]: With dead ends: 877 [2025-03-17 11:55:01,730 INFO L226 Difference]: Without dead ends: 877 [2025-03-17 11:55:01,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:01,731 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 171 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:01,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 149 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-17 11:55:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 756. [2025-03-17 11:55:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 744 states have (on average 1.4623655913978495) internal successors, (1088), 755 states have internal predecessors, (1088), 0 states have call successors, (0), 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:55:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1088 transitions. [2025-03-17 11:55:01,746 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1088 transitions. Word has length 23 [2025-03-17 11:55:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:01,746 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1088 transitions. [2025-03-17 11:55:01,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1088 transitions. [2025-03-17 11:55:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:01,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:01,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:01,753 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:55:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:01,947 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:01,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2128164971, now seen corresponding path program 1 times [2025-03-17 11:55:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517321044] [2025-03-17 11:55:01,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:01,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:01,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:01,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:55:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517321044] [2025-03-17 11:55:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517321044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471045538] [2025-03-17 11:55:02,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:02,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:02,011 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:55:02,013 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:55:02,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:02,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:02,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:02,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:02,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:55:02,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:55:02,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:55:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471045538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:02,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 11:55:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512029992] [2025-03-17 11:55:02,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:02,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:02,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:02,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:02,121 INFO L87 Difference]: Start difference. First operand 756 states and 1088 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:02,166 INFO L93 Difference]: Finished difference Result 334 states and 462 transitions. [2025-03-17 11:55:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 11:55:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:02,168 INFO L225 Difference]: With dead ends: 334 [2025-03-17 11:55:02,168 INFO L226 Difference]: Without dead ends: 334 [2025-03-17 11:55:02,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:02,169 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:02,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 343 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-17 11:55:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 322. [2025-03-17 11:55:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 310 states have (on average 1.4387096774193548) internal successors, (446), 321 states have internal predecessors, (446), 0 states have call successors, (0), 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:55:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 446 transitions. [2025-03-17 11:55:02,182 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 446 transitions. Word has length 25 [2025-03-17 11:55:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:02,182 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 446 transitions. [2025-03-17 11:55:02,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 446 transitions. [2025-03-17 11:55:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:02,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:02,183 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:02,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:55:02,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:02,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:02,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -423955319, now seen corresponding path program 1 times [2025-03-17 11:55:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061331774] [2025-03-17 11:55:02,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:02,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:02,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:02,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061331774] [2025-03-17 11:55:02,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061331774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016702138] [2025-03-17 11:55:02,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:02,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:02,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:02,473 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:55:02,476 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:55:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:02,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:55:02,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:02,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:02,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016702138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:02,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:02,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 11:55:02,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181163186] [2025-03-17 11:55:02,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:02,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:02,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:02,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:55:02,615 INFO L87 Difference]: Start difference. First operand 322 states and 446 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:02,715 INFO L93 Difference]: Finished difference Result 943 states and 1256 transitions. [2025-03-17 11:55:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:55:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 11:55:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:02,717 INFO L225 Difference]: With dead ends: 943 [2025-03-17 11:55:02,717 INFO L226 Difference]: Without dead ends: 943 [2025-03-17 11:55:02,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:55:02,718 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 255 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:02,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 607 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-17 11:55:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 838. [2025-03-17 11:55:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 826 states have (on average 1.4116222760290558) internal successors, (1166), 837 states have internal predecessors, (1166), 0 states have call successors, (0), 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:55:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1166 transitions. [2025-03-17 11:55:02,733 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1166 transitions. Word has length 25 [2025-03-17 11:55:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:02,733 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1166 transitions. [2025-03-17 11:55:02,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1166 transitions. [2025-03-17 11:55:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:02,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:02,736 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:02,743 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:55:02,936 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,SelfDestructingSolverStorable11 [2025-03-17 11:55:02,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:02,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -31368220, now seen corresponding path program 2 times [2025-03-17 11:55:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652249171] [2025-03-17 11:55:02,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:55:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:02,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-17 11:55:02,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:02,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:55:02,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 11:55:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652249171] [2025-03-17 11:55:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652249171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306410323] [2025-03-17 11:55:03,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:55:03,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:03,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:03,135 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:55:03,137 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:55:03,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-17 11:55:03,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:03,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:55:03,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:03,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 11:55:03,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:03,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306410323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:03,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2025-03-17 11:55:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616309986] [2025-03-17 11:55:03,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:03,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:55:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:03,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:55:03,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:03,412 INFO L87 Difference]: Start difference. First operand 838 states and 1166 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 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:55:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:04,097 INFO L93 Difference]: Finished difference Result 1442 states and 1899 transitions. [2025-03-17 11:55:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-17 11:55:04,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-17 11:55:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:04,103 INFO L225 Difference]: With dead ends: 1442 [2025-03-17 11:55:04,103 INFO L226 Difference]: Without dead ends: 1423 [2025-03-17 11:55:04,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=734, Invalid=3298, Unknown=0, NotChecked=0, Total=4032 [2025-03-17 11:55:04,106 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 533 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:04,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1018 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-17 11:55:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1278. [2025-03-17 11:55:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1266 states have (on average 1.3886255924170616) internal successors, (1758), 1277 states have internal predecessors, (1758), 0 states have call successors, (0), 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:55:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1758 transitions. [2025-03-17 11:55:04,128 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1758 transitions. Word has length 49 [2025-03-17 11:55:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:04,128 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1758 transitions. [2025-03-17 11:55:04,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 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:55:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1758 transitions. [2025-03-17 11:55:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:55:04,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:04,131 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:04,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:04,332 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:04,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash 14636398, now seen corresponding path program 1 times [2025-03-17 11:55:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-17 11:55:04,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:04,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:04,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:55:04,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:55:04,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:55:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56326566] [2025-03-17 11:55:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56326566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789109023] [2025-03-17 11:55:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:04,432 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:55:04,433 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:55:04,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:55:04,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:55:04,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:04,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:04,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:55:04,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:55:04,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:55:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789109023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:04,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2025-03-17 11:55:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640072838] [2025-03-17 11:55:04,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:04,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:04,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:04,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:04,614 INFO L87 Difference]: Start difference. First operand 1278 states and 1758 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 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:55:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:05,801 INFO L93 Difference]: Finished difference Result 3386 states and 4548 transitions. [2025-03-17 11:55:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-17 11:55:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-17 11:55:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:05,811 INFO L225 Difference]: With dead ends: 3386 [2025-03-17 11:55:05,812 INFO L226 Difference]: Without dead ends: 3386 [2025-03-17 11:55:05,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=881, Invalid=3675, Unknown=0, NotChecked=0, Total=4556 [2025-03-17 11:55:05,813 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 656 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:05,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1000 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:55:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-17 11:55:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2775. [2025-03-17 11:55:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2764 states have (on average 1.3994211287988423) internal successors, (3868), 2774 states have internal predecessors, (3868), 0 states have call successors, (0), 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:55:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3868 transitions. [2025-03-17 11:55:05,871 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3868 transitions. Word has length 50 [2025-03-17 11:55:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:05,871 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 3868 transitions. [2025-03-17 11:55:05,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 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:55:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3868 transitions. [2025-03-17 11:55:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:55:05,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:05,872 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:05,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:06,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:06,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash 311796901, now seen corresponding path program 1 times [2025-03-17 11:55:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-03-17 11:55:06,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:06,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:55:06,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:55:06,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:06,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 11:55:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-03-17 11:55:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040230450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470919315] [2025-03-17 11:55:06,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:06,226 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:55:06,228 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:55:06,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:55:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:55:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:06,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:55:06,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 11:55:06,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 11:55:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470919315] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:06,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:06,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-17 11:55:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154367976] [2025-03-17 11:55:06,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:06,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:06,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:06,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:06,392 INFO L87 Difference]: Start difference. First operand 2775 states and 3868 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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:55:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:06,562 INFO L93 Difference]: Finished difference Result 3020 states and 4017 transitions. [2025-03-17 11:55:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:55:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-17 11:55:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:06,570 INFO L225 Difference]: With dead ends: 3020 [2025-03-17 11:55:06,570 INFO L226 Difference]: Without dead ends: 3020 [2025-03-17 11:55:06,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:55:06,571 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 347 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:06,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 569 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2025-03-17 11:55:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2234. [2025-03-17 11:55:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2223 states have (on average 1.3670715249662617) internal successors, (3039), 2233 states have internal predecessors, (3039), 0 states have call successors, (0), 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:55:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3039 transitions. [2025-03-17 11:55:06,604 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3039 transitions. Word has length 57 [2025-03-17 11:55:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:06,604 INFO L471 AbstractCegarLoop]: Abstraction has 2234 states and 3039 transitions. [2025-03-17 11:55:06,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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:55:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3039 transitions. [2025-03-17 11:55:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:55:06,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:06,605 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:06,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 11:55:06,805 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,SelfDestructingSolverStorable14 [2025-03-17 11:55:06,805 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:06,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash -595121574, now seen corresponding path program 1 times [2025-03-17 11:55:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111077133] [2025-03-17 11:55:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:55:06,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:55:06,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:06,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 11:55:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111077133] [2025-03-17 11:55:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111077133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18682223] [2025-03-17 11:55:06,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:06,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:06,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:06,910 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:55:06,912 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:55:06,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:55:06,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:55:06,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:06,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:06,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:55:06,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 11:55:07,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 11:55:07,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18682223] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:07,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:55:07,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-03-17 11:55:07,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869140436] [2025-03-17 11:55:07,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:07,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:07,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:07,095 INFO L87 Difference]: Start difference. First operand 2234 states and 3039 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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:55:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:07,171 INFO L93 Difference]: Finished difference Result 3514 states and 4732 transitions. [2025-03-17 11:55:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-17 11:55:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:07,180 INFO L225 Difference]: With dead ends: 3514 [2025-03-17 11:55:07,180 INFO L226 Difference]: Without dead ends: 3514 [2025-03-17 11:55:07,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:55:07,181 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 57 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:07,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 316 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2025-03-17 11:55:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3377. [2025-03-17 11:55:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3377 states, 3366 states have (on average 1.3666072489601901) internal successors, (4600), 3376 states have internal predecessors, (4600), 0 states have call successors, (0), 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:55:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4600 transitions. [2025-03-17 11:55:07,232 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4600 transitions. Word has length 57 [2025-03-17 11:55:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:07,233 INFO L471 AbstractCegarLoop]: Abstraction has 3377 states and 4600 transitions. [2025-03-17 11:55:07,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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:55:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4600 transitions. [2025-03-17 11:55:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 11:55:07,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:07,235 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:07,243 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:55:07,435 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,SelfDestructingSolverStorable15 [2025-03-17 11:55:07,435 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:07,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -674752292, now seen corresponding path program 1 times [2025-03-17 11:55:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:07,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-03-17 11:55:07,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:07,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:07,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:55:07,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:55:07,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:07,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-17 11:55:07,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:07,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-03-17 11:55:07,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49895653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:07,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496733580] [2025-03-17 11:55:07,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:07,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:07,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:07,597 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:55:07,599 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:55:07,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:55:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:55:07,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:07,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:07,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:55:07,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:55:07,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:55:07,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496733580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:07,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:07,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-03-17 11:55:07,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738663914] [2025-03-17 11:55:07,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:07,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:55:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:07,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:55:07,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:07,798 INFO L87 Difference]: Start difference. First operand 3377 states and 4600 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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:55:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:08,177 INFO L93 Difference]: Finished difference Result 7195 states and 9701 transitions. [2025-03-17 11:55:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 11:55:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-17 11:55:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:08,193 INFO L225 Difference]: With dead ends: 7195 [2025-03-17 11:55:08,194 INFO L226 Difference]: Without dead ends: 7195 [2025-03-17 11:55:08,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:55:08,194 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 408 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:08,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 714 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7195 states. [2025-03-17 11:55:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7195 to 3922. [2025-03-17 11:55:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3911 states have (on average 1.3589874712349783) internal successors, (5315), 3921 states have internal predecessors, (5315), 0 states have call successors, (0), 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:55:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5315 transitions. [2025-03-17 11:55:08,280 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5315 transitions. Word has length 61 [2025-03-17 11:55:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:08,280 INFO L471 AbstractCegarLoop]: Abstraction has 3922 states and 5315 transitions. [2025-03-17 11:55:08,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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:55:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5315 transitions. [2025-03-17 11:55:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 11:55:08,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:08,282 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:08,289 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:55:08,482 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,SelfDestructingSolverStorable16 [2025-03-17 11:55:08,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 606998057, now seen corresponding path program 1 times [2025-03-17 11:55:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-03-17 11:55:08,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:55:08,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:55:08,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:08,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:55:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-03-17 11:55:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586430102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454443277] [2025-03-17 11:55:08,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:08,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:08,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:08,554 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:55:08,555 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:55:08,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:55:08,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:55:08,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:08,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:08,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:55:08,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:55:08,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 11:55:08,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454443277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:08,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 11:55:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586145312] [2025-03-17 11:55:08,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:08,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:08,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:08,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:08,734 INFO L87 Difference]: Start difference. First operand 3922 states and 5315 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:08,804 INFO L93 Difference]: Finished difference Result 3929 states and 5313 transitions. [2025-03-17 11:55:08,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:08,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-17 11:55:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:08,816 INFO L225 Difference]: With dead ends: 3929 [2025-03-17 11:55:08,816 INFO L226 Difference]: Without dead ends: 3929 [2025-03-17 11:55:08,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:08,816 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 104 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:08,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 241 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2025-03-17 11:55:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 3920. [2025-03-17 11:55:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3909 states have (on average 1.3581478639038118) internal successors, (5309), 3919 states have internal predecessors, (5309), 0 states have call successors, (0), 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:55:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5309 transitions. [2025-03-17 11:55:08,858 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5309 transitions. Word has length 62 [2025-03-17 11:55:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:08,859 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 5309 transitions. [2025-03-17 11:55:08,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5309 transitions. [2025-03-17 11:55:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 11:55:08,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:08,860 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:08,866 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:55:09,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:55:09,060 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:09,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1909271374, now seen corresponding path program 1 times [2025-03-17 11:55:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 11:55:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:55:09,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:55:09,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:09,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 11:55:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 11:55:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744186530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717929570] [2025-03-17 11:55:09,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:09,158 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:55:09,159 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:55:09,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:55:09,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:55:09,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:09,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:09,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 11:55:09,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 11:55:09,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 11:55:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717929570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:09,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2025-03-17 11:55:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037370447] [2025-03-17 11:55:09,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:09,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:09,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:09,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:09,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:09,320 INFO L87 Difference]: Start difference. First operand 3920 states and 5309 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 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:55:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:09,492 INFO L93 Difference]: Finished difference Result 4225 states and 5636 transitions. [2025-03-17 11:55:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:55:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-17 11:55:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:09,504 INFO L225 Difference]: With dead ends: 4225 [2025-03-17 11:55:09,504 INFO L226 Difference]: Without dead ends: 4225 [2025-03-17 11:55:09,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:55:09,504 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 73 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 869 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2025-03-17 11:55:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 3478. [2025-03-17 11:55:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3467 states have (on average 1.3567926160946062) internal successors, (4704), 3477 states have internal predecessors, (4704), 0 states have call successors, (0), 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:55:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4704 transitions. [2025-03-17 11:55:09,541 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4704 transitions. Word has length 62 [2025-03-17 11:55:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:09,541 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 4704 transitions. [2025-03-17 11:55:09,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 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:55:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4704 transitions. [2025-03-17 11:55:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 11:55:09,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:09,542 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:09,549 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:55:09,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:09,747 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:09,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash -368999221, now seen corresponding path program 1 times [2025-03-17 11:55:09,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:09,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932029002] [2025-03-17 11:55:09,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:09,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:09,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:55:09,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:55:09,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 11:55:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932029002] [2025-03-17 11:55:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932029002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233383407] [2025-03-17 11:55:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:09,847 INFO L229 MonitoredProcess]: Starting monitored process 14 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:55:09,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 11:55:09,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:55:09,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:55:09,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:09,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:09,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:55:09,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 81 proven. 38 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 11:55:09,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 81 proven. 38 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 11:55:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233383407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:10,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 11:55:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672307] [2025-03-17 11:55:10,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:10,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:10,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:10,037 INFO L87 Difference]: Start difference. First operand 3478 states and 4704 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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:55:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:10,182 INFO L93 Difference]: Finished difference Result 1967 states and 2532 transitions. [2025-03-17 11:55:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:55:10,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-17 11:55:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:10,185 INFO L225 Difference]: With dead ends: 1967 [2025-03-17 11:55:10,185 INFO L226 Difference]: Without dead ends: 1967 [2025-03-17 11:55:10,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:55:10,186 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 150 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:10,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1444 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-03-17 11:55:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1872. [2025-03-17 11:55:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1861 states have (on average 1.3170338527673293) internal successors, (2451), 1871 states have internal predecessors, (2451), 0 states have call successors, (0), 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:55:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2451 transitions. [2025-03-17 11:55:10,204 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2451 transitions. Word has length 66 [2025-03-17 11:55:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:10,205 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2451 transitions. [2025-03-17 11:55:10,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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:55:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2451 transitions. [2025-03-17 11:55:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 11:55:10,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:10,206 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:10,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:10,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-17 11:55:10,407 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 561674386, now seen corresponding path program 1 times [2025-03-17 11:55:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561271069] [2025-03-17 11:55:10,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:10,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:55:10,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:55:10,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:10,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 11:55:10,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:10,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561271069] [2025-03-17 11:55:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561271069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117633284] [2025-03-17 11:55:10,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:10,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:10,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:10,555 INFO L229 MonitoredProcess]: Starting monitored process 15 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:55:10,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 11:55:10,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 11:55:10,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 11:55:10,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:10,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:10,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:55:10,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:10,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:55:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 11:55:10,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 11:55:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117633284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:11,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:11,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2025-03-17 11:55:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730270852] [2025-03-17 11:55:11,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:11,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:55:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:11,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:55:11,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:11,077 INFO L87 Difference]: Start difference. First operand 1872 states and 2451 transitions. Second operand has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:11,342 INFO L93 Difference]: Finished difference Result 3635 states and 4661 transitions. [2025-03-17 11:55:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:55:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 11:55:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:11,348 INFO L225 Difference]: With dead ends: 3635 [2025-03-17 11:55:11,348 INFO L226 Difference]: Without dead ends: 3635 [2025-03-17 11:55:11,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:55:11,349 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 700 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:11,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 593 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2025-03-17 11:55:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 2714. [2025-03-17 11:55:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2703 states have (on average 1.332963374028857) internal successors, (3603), 2713 states have internal predecessors, (3603), 0 states have call successors, (0), 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:55:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3603 transitions. [2025-03-17 11:55:11,396 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3603 transitions. Word has length 68 [2025-03-17 11:55:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:11,397 INFO L471 AbstractCegarLoop]: Abstraction has 2714 states and 3603 transitions. [2025-03-17 11:55:11,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.416666666666666) internal successors, (113), 13 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3603 transitions. [2025-03-17 11:55:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 11:55:11,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:11,398 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:11,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 11:55:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:11,599 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1912295425, now seen corresponding path program 1 times [2025-03-17 11:55:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40543158] [2025-03-17 11:55:11,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:11,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:55:11,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:55:11,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 122 proven. 83 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 11:55:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40543158] [2025-03-17 11:55:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40543158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200103557] [2025-03-17 11:55:11,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:11,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:11,671 INFO L229 MonitoredProcess]: Starting monitored process 16 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:55:11,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 11:55:11,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:55:11,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:55:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:11,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 11:55:11,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-17 11:55:11,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200103557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 11:55:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436162364] [2025-03-17 11:55:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:11,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:11,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:11,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:11,814 INFO L87 Difference]: Start difference. First operand 2714 states and 3603 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:55:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:11,843 INFO L93 Difference]: Finished difference Result 3038 states and 3911 transitions. [2025-03-17 11:55:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-17 11:55:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:11,848 INFO L225 Difference]: With dead ends: 3038 [2025-03-17 11:55:11,848 INFO L226 Difference]: Without dead ends: 3038 [2025-03-17 11:55:11,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:11,850 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:11,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 126 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2025-03-17 11:55:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2750. [2025-03-17 11:55:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2739 states have (on average 1.308141657539248) internal successors, (3583), 2749 states have internal predecessors, (3583), 0 states have call successors, (0), 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:55:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3583 transitions. [2025-03-17 11:55:11,875 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3583 transitions. Word has length 94 [2025-03-17 11:55:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3583 transitions. [2025-03-17 11:55:11,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:55:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3583 transitions. [2025-03-17 11:55:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 11:55:11,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:11,877 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 4, 4, 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] [2025-03-17 11:55:11,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:12,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:12,079 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:12,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1154699269, now seen corresponding path program 1 times [2025-03-17 11:55:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:12,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418984429] [2025-03-17 11:55:12,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:12,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:55:12,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:55:12,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:12,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 128 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 11:55:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418984429] [2025-03-17 11:55:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418984429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128322151] [2025-03-17 11:55:12,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:12,190 INFO L229 MonitoredProcess]: Starting monitored process 17 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:55:12,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 11:55:12,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:55:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:55:12,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:12,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:12,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:55:12,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 118 proven. 57 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-17 11:55:12,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 118 proven. 57 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-17 11:55:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128322151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:12,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-17 11:55:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755177271] [2025-03-17 11:55:12,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:12,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:12,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:12,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:12,427 INFO L87 Difference]: Start difference. First operand 2750 states and 3583 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:12,578 INFO L93 Difference]: Finished difference Result 2587 states and 3115 transitions. [2025-03-17 11:55:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:55:12,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-17 11:55:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:12,582 INFO L225 Difference]: With dead ends: 2587 [2025-03-17 11:55:12,582 INFO L226 Difference]: Without dead ends: 2587 [2025-03-17 11:55:12,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:55:12,582 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 139 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:12,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 989 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-03-17 11:55:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 1942. [2025-03-17 11:55:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1932 states have (on average 1.2261904761904763) internal successors, (2369), 1941 states have internal predecessors, (2369), 0 states have call successors, (0), 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:55:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2369 transitions. [2025-03-17 11:55:12,597 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2369 transitions. Word has length 96 [2025-03-17 11:55:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:12,597 INFO L471 AbstractCegarLoop]: Abstraction has 1942 states and 2369 transitions. [2025-03-17 11:55:12,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2369 transitions. [2025-03-17 11:55:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 11:55:12,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:12,598 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2025-03-17 11:55:12,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 11:55:12,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 11:55:12,799 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash -134593941, now seen corresponding path program 1 times [2025-03-17 11:55:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331460090] [2025-03-17 11:55:12,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:12,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:55:12,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:55:12,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 211 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-17 11:55:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331460090] [2025-03-17 11:55:12,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331460090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940477313] [2025-03-17 11:55:12,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:12,907 INFO L229 MonitoredProcess]: Starting monitored process 18 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:55:12,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 11:55:12,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:55:13,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:55:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:13,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:13,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:55:13,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 166 proven. 24 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-17 11:55:13,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 166 proven. 24 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-17 11:55:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940477313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:13,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-17 11:55:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216807317] [2025-03-17 11:55:13,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:13,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:13,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:13,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:13,297 INFO L87 Difference]: Start difference. First operand 1942 states and 2369 transitions. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 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:55:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:13,957 INFO L93 Difference]: Finished difference Result 5125 states and 6161 transitions. [2025-03-17 11:55:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 11:55:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-17 11:55:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:13,964 INFO L225 Difference]: With dead ends: 5125 [2025-03-17 11:55:13,965 INFO L226 Difference]: Without dead ends: 5125 [2025-03-17 11:55:13,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=427, Invalid=1295, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:55:13,966 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1160 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:13,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 888 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2025-03-17 11:55:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 1943. [2025-03-17 11:55:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1933 states have (on average 1.2260734609415416) internal successors, (2370), 1942 states have internal predecessors, (2370), 0 states have call successors, (0), 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:55:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2370 transitions. [2025-03-17 11:55:13,989 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2370 transitions. Word has length 110 [2025-03-17 11:55:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:13,989 INFO L471 AbstractCegarLoop]: Abstraction has 1943 states and 2370 transitions. [2025-03-17 11:55:13,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 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:55:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2370 transitions. [2025-03-17 11:55:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 11:55:13,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:13,990 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2025-03-17 11:55:13,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:14,195 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -134593590, now seen corresponding path program 1 times [2025-03-17 11:55:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608751534] [2025-03-17 11:55:14,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:14,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:55:14,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:55:14,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:14,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 158 proven. 16 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-17 11:55:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608751534] [2025-03-17 11:55:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608751534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030986581] [2025-03-17 11:55:14,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:14,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:14,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:14,262 INFO L229 MonitoredProcess]: Starting monitored process 19 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:55:14,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 11:55:14,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:55:14,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:55:14,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:14,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:14,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:55:14,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:14,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:14,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030986581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:14,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:14,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 5 [2025-03-17 11:55:14,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830344374] [2025-03-17 11:55:14,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:14,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:14,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:14,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:14,593 INFO L87 Difference]: Start difference. First operand 1943 states and 2370 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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:55:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:14,806 INFO L93 Difference]: Finished difference Result 2746 states and 3298 transitions. [2025-03-17 11:55:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-17 11:55:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:14,809 INFO L225 Difference]: With dead ends: 2746 [2025-03-17 11:55:14,809 INFO L226 Difference]: Without dead ends: 2746 [2025-03-17 11:55:14,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:14,810 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 270 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:14,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 394 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2025-03-17 11:55:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1943. [2025-03-17 11:55:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1934 states have (on average 1.2259565667011376) internal successors, (2371), 1942 states have internal predecessors, (2371), 0 states have call successors, (0), 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:55:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2371 transitions. [2025-03-17 11:55:14,823 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2371 transitions. Word has length 110 [2025-03-17 11:55:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:14,823 INFO L471 AbstractCegarLoop]: Abstraction has 1943 states and 2371 transitions. [2025-03-17 11:55:14,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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:55:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2371 transitions. [2025-03-17 11:55:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 11:55:14,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:14,825 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2025-03-17 11:55:14,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:15,025 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:15,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash -134593589, now seen corresponding path program 1 times [2025-03-17 11:55:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-03-17 11:55:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:15,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:55:15,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:55:15,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:15,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-03-17 11:55:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621402548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598167298] [2025-03-17 11:55:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:15,276 INFO L229 MonitoredProcess]: Starting monitored process 20 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:55:15,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 11:55:15,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:55:15,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:55:15,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:15,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:15,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:55:15,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:15,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:55:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:15,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598167298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:15,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-17 11:55:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383659168] [2025-03-17 11:55:15,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:15,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:55:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:55:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:15,890 INFO L87 Difference]: Start difference. First operand 1943 states and 2371 transitions. Second operand has 14 states, 13 states have (on average 13.23076923076923) internal successors, (172), 14 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:16,360 INFO L93 Difference]: Finished difference Result 5638 states and 6814 transitions. [2025-03-17 11:55:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:55:16,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.23076923076923) internal successors, (172), 14 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-17 11:55:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:16,367 INFO L225 Difference]: With dead ends: 5638 [2025-03-17 11:55:16,367 INFO L226 Difference]: Without dead ends: 5638 [2025-03-17 11:55:16,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=654, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:55:16,368 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1004 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 927 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2025-03-17 11:55:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 2060. [2025-03-17 11:55:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2051 states have (on average 1.2291565090199903) internal successors, (2521), 2059 states have internal predecessors, (2521), 0 states have call successors, (0), 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:55:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2521 transitions. [2025-03-17 11:55:16,393 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2521 transitions. Word has length 110 [2025-03-17 11:55:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:16,393 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 2521 transitions. [2025-03-17 11:55:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.23076923076923) internal successors, (172), 14 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2521 transitions. [2025-03-17 11:55:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 11:55:16,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:16,395 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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:55:16,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 11:55:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:16,599 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793855, now seen corresponding path program 1 times [2025-03-17 11:55:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531340806] [2025-03-17 11:55:16,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:55:16,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:55:16,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:16,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:16,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531340806] [2025-03-17 11:55:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531340806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690098462] [2025-03-17 11:55:16,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:16,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:16,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:16,733 INFO L229 MonitoredProcess]: Starting monitored process 21 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:55:16,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 11:55:16,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:55:16,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:55:16,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:16,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:16,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:55:16,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:16,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690098462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:17,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:17,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-17 11:55:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159524967] [2025-03-17 11:55:17,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:17,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:17,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:17,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:17,083 INFO L87 Difference]: Start difference. First operand 2060 states and 2521 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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:55:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:17,262 INFO L93 Difference]: Finished difference Result 3996 states and 4861 transitions. [2025-03-17 11:55:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:55:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-17 11:55:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:17,267 INFO L225 Difference]: With dead ends: 3996 [2025-03-17 11:55:17,267 INFO L226 Difference]: Without dead ends: 3996 [2025-03-17 11:55:17,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:17,270 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 476 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:17,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 261 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:17,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2025-03-17 11:55:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 2061. [2025-03-17 11:55:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2052 states have (on average 1.2290448343079923) internal successors, (2522), 2060 states have internal predecessors, (2522), 0 states have call successors, (0), 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:55:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2522 transitions. [2025-03-17 11:55:17,291 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2522 transitions. Word has length 113 [2025-03-17 11:55:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:17,291 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 2522 transitions. [2025-03-17 11:55:17,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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:55:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2522 transitions. [2025-03-17 11:55:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 11:55:17,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:17,293 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:17,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:17,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 11:55:17,493 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:17,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1403712339, now seen corresponding path program 1 times [2025-03-17 11:55:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:17,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791370968] [2025-03-17 11:55:17,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:55:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:55:17,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:17,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 84 proven. 313 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:55:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791370968] [2025-03-17 11:55:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791370968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967802386] [2025-03-17 11:55:17,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:17,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:17,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:17,935 INFO L229 MonitoredProcess]: Starting monitored process 22 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:55:17,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 11:55:18,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:55:18,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:55:18,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:18,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:18,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:55:18,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:18,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:18,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 70 proven. 291 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-17 11:55:18,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 70 proven. 291 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-17 11:55:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967802386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:18,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:18,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2025-03-17 11:55:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858507983] [2025-03-17 11:55:18,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:18,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:55:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:18,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:55:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:55:18,640 INFO L87 Difference]: Start difference. First operand 2061 states and 2522 transitions. Second operand has 18 states, 18 states have (on average 9.38888888888889) internal successors, (169), 17 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:20,880 INFO L93 Difference]: Finished difference Result 12578 states and 14858 transitions. [2025-03-17 11:55:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-17 11:55:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.38888888888889) internal successors, (169), 17 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-17 11:55:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:20,892 INFO L225 Difference]: With dead ends: 12578 [2025-03-17 11:55:20,892 INFO L226 Difference]: Without dead ends: 12578 [2025-03-17 11:55:20,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4028 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1558, Invalid=9572, Unknown=0, NotChecked=0, Total=11130 [2025-03-17 11:55:20,895 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 2535 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:20,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 2415 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:55:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12578 states. [2025-03-17 11:55:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12578 to 3341. [2025-03-17 11:55:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3332 states have (on average 1.2178871548619448) internal successors, (4058), 3340 states have internal predecessors, (4058), 0 states have call successors, (0), 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:55:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 4058 transitions. [2025-03-17 11:55:20,956 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 4058 transitions. Word has length 116 [2025-03-17 11:55:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:20,957 INFO L471 AbstractCegarLoop]: Abstraction has 3341 states and 4058 transitions. [2025-03-17 11:55:20,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.38888888888889) internal successors, (169), 17 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 4058 transitions. [2025-03-17 11:55:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 11:55:20,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:20,959 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:20,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 11:55:21,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 11:55:21,160 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1853955204, now seen corresponding path program 1 times [2025-03-17 11:55:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211837699] [2025-03-17 11:55:21,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:21,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:55:21,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:55:21,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:21,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211837699] [2025-03-17 11:55:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211837699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041373865] [2025-03-17 11:55:21,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:21,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:21,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:21,346 INFO L229 MonitoredProcess]: Starting monitored process 23 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:55:21,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 11:55:21,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:55:21,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:55:21,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:21,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:21,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:55:21,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:21,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:21,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:21,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_31 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_31) 0)) (= (store |c_#valid| v_~x1~0.base_31 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-03-17 11:55:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 95 trivial. 48 not checked. [2025-03-17 11:55:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041373865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:21,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:21,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2025-03-17 11:55:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972674264] [2025-03-17 11:55:21,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:21,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:55:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:21,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:55:21,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2025-03-17 11:55:21,750 INFO L87 Difference]: Start difference. First operand 3341 states and 4058 transitions. Second operand has 9 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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:55:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:22,029 INFO L93 Difference]: Finished difference Result 8167 states and 9834 transitions. [2025-03-17 11:55:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-17 11:55:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:22,041 INFO L225 Difference]: With dead ends: 8167 [2025-03-17 11:55:22,041 INFO L226 Difference]: Without dead ends: 8165 [2025-03-17 11:55:22,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=218, Unknown=1, NotChecked=32, Total=342 [2025-03-17 11:55:22,042 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 403 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:22,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 564 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 394 Unchecked, 0.2s Time] [2025-03-17 11:55:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8165 states. [2025-03-17 11:55:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8165 to 5781. [2025-03-17 11:55:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5781 states, 5772 states have (on average 1.2136174636174637) internal successors, (7005), 5780 states have internal predecessors, (7005), 0 states have call successors, (0), 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:55:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 7005 transitions. [2025-03-17 11:55:22,095 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 7005 transitions. Word has length 116 [2025-03-17 11:55:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:22,095 INFO L471 AbstractCegarLoop]: Abstraction has 5781 states and 7005 transitions. [2025-03-17 11:55:22,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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:55:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 7005 transitions. [2025-03-17 11:55:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 11:55:22,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:22,097 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:22,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:22,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 11:55:22,299 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:22,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1853955555, now seen corresponding path program 1 times [2025-03-17 11:55:22,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:22,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058416617] [2025-03-17 11:55:22,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:22,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:55:22,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:55:22,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:22,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 41 proven. 199 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 11:55:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058416617] [2025-03-17 11:55:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058416617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432207898] [2025-03-17 11:55:22,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:22,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:22,867 INFO L229 MonitoredProcess]: Starting monitored process 24 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:55:22,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 11:55:22,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:55:22,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:55:22,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:22,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:22,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:55:22,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:23,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:23,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:23,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:23,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 11:55:23,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:23,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 11:55:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-17 11:55:23,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:23,545 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 12 treesize of output 10 [2025-03-17 11:55:23,548 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 18 treesize of output 16 [2025-03-17 11:55:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-17 11:55:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432207898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:23,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-17 11:55:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124300753] [2025-03-17 11:55:23,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:55:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:55:23,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:23,739 INFO L87 Difference]: Start difference. First operand 5781 states and 7005 transitions. Second operand has 21 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 20 states have internal predecessors, (148), 0 states have call successors, (0), 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:55:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:24,159 INFO L93 Difference]: Finished difference Result 11612 states and 13940 transitions. [2025-03-17 11:55:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:55:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 20 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-17 11:55:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:24,172 INFO L225 Difference]: With dead ends: 11612 [2025-03-17 11:55:24,172 INFO L226 Difference]: Without dead ends: 11598 [2025-03-17 11:55:24,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:55:24,174 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 220 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:24,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 709 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11598 states. [2025-03-17 11:55:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11598 to 7737. [2025-03-17 11:55:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7737 states, 7728 states have (on average 1.2166149068322982) internal successors, (9402), 7736 states have internal predecessors, (9402), 0 states have call successors, (0), 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:55:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7737 states to 7737 states and 9402 transitions. [2025-03-17 11:55:24,258 INFO L78 Accepts]: Start accepts. Automaton has 7737 states and 9402 transitions. Word has length 116 [2025-03-17 11:55:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:24,258 INFO L471 AbstractCegarLoop]: Abstraction has 7737 states and 9402 transitions. [2025-03-17 11:55:24,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 20 states have internal predecessors, (148), 0 states have call successors, (0), 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:55:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7737 states and 9402 transitions. [2025-03-17 11:55:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 11:55:24,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:24,264 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1] [2025-03-17 11:55:24,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:24,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:24,465 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:24,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1379612453, now seen corresponding path program 1 times [2025-03-17 11:55:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:24,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774728862] [2025-03-17 11:55:24,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:24,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:55:24,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:55:24,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:24,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 419 proven. 4 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 11:55:24,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774728862] [2025-03-17 11:55:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774728862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:24,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140369708] [2025-03-17 11:55:24,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:24,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:24,614 INFO L229 MonitoredProcess]: Starting monitored process 25 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:55:24,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 11:55:24,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:55:24,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:55:24,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:24,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:55:24,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 419 proven. 4 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 11:55:24,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 11:55:24,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140369708] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:24,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:55:24,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2025-03-17 11:55:24,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171927563] [2025-03-17 11:55:24,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:24,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:24,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:24,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:24,904 INFO L87 Difference]: Start difference. First operand 7737 states and 9402 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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:55:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:24,949 INFO L93 Difference]: Finished difference Result 4809 states and 5765 transitions. [2025-03-17 11:55:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-17 11:55:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:24,953 INFO L225 Difference]: With dead ends: 4809 [2025-03-17 11:55:24,953 INFO L226 Difference]: Without dead ends: 4809 [2025-03-17 11:55:24,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:24,954 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:24,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 330 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-17 11:55:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4638. [2025-03-17 11:55:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 4629 states have (on average 1.20349967595593) internal successors, (5571), 4637 states have internal predecessors, (5571), 0 states have call successors, (0), 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:55:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 5571 transitions. [2025-03-17 11:55:24,985 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 5571 transitions. Word has length 145 [2025-03-17 11:55:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:24,985 INFO L471 AbstractCegarLoop]: Abstraction has 4638 states and 5571 transitions. [2025-03-17 11:55:24,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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:55:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 5571 transitions. [2025-03-17 11:55:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 11:55:24,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:24,988 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 16, 12, 11, 9, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:55:24,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:25,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:25,190 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:25,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:25,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2042177434, now seen corresponding path program 2 times [2025-03-17 11:55:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:25,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941853521] [2025-03-17 11:55:25,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:55:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:25,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-17 11:55:25,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 11:55:25,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:55:25,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 418 proven. 3 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 11:55:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941853521] [2025-03-17 11:55:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941853521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796799892] [2025-03-17 11:55:25,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:55:25,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:25,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:25,355 INFO L229 MonitoredProcess]: Starting monitored process 26 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:55:25,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 11:55:25,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-17 11:55:25,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 11:55:25,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:55:25,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:25,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:55:25,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 377 proven. 97 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-17 11:55:25,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 377 proven. 97 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-17 11:55:25,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796799892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:25,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:25,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 11:55:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432288339] [2025-03-17 11:55:25,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:25,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:55:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:25,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:55:25,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:25,705 INFO L87 Difference]: Start difference. First operand 4638 states and 5571 transitions. Second operand has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:25,845 INFO L93 Difference]: Finished difference Result 4289 states and 4889 transitions. [2025-03-17 11:55:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:55:25,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-03-17 11:55:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:25,848 INFO L225 Difference]: With dead ends: 4289 [2025-03-17 11:55:25,848 INFO L226 Difference]: Without dead ends: 4289 [2025-03-17 11:55:25,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:55:25,848 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 149 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:25,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1116 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2025-03-17 11:55:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4023. [2025-03-17 11:55:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4023 states, 4014 states have (on average 1.1477329347284504) internal successors, (4607), 4022 states have internal predecessors, (4607), 0 states have call successors, (0), 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:55:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 4607 transitions. [2025-03-17 11:55:25,884 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 4607 transitions. Word has length 154 [2025-03-17 11:55:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:25,885 INFO L471 AbstractCegarLoop]: Abstraction has 4023 states and 4607 transitions. [2025-03-17 11:55:25,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 4607 transitions. [2025-03-17 11:55:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 11:55:25,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:25,888 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 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:55:25,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:26,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 11:55:26,089 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-17 11:55:26,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1229885891, now seen corresponding path program 1 times [2025-03-17 11:55:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510196302] [2025-03-17 11:55:26,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:26,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 11:55:26,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 11:55:26,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:26,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 10 proven. 776 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-17 11:55:27,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510196302] [2025-03-17 11:55:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510196302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:27,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841832400] [2025-03-17 11:55:27,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:27,059 INFO L229 MonitoredProcess]: Starting monitored process 27 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:55:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 11:55:27,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 11:55:27,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 11:55:27,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:27,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:27,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 11:55:27,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:27,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:27,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:27,689 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:55:27,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:55:27,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:27,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:55:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 672 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 11:55:28,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:55:28,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~t4~0.offset 4))) (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1432) c_~t4~0.base) .cse0) 0)) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1433) c_~t4~0.base) .cse0) 0)))) is different from false [2025-03-17 11:55:28,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:28,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 11:55:28,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-17 11:55:28,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:28,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:28,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 11:55:28,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:28,770 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 20 treesize of output 8 [2025-03-17 11:55:29,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-03-17 11:55:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 442 refuted. 0 times theorem prover too weak. 57 trivial. 240 not checked. [2025-03-17 11:55:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841832400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:55:29,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:55:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 36 [2025-03-17 11:55:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865467876] [2025-03-17 11:55:29,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:55:29,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 11:55:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:29,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 11:55:29,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1142, Unknown=2, NotChecked=68, Total=1332 [2025-03-17 11:55:29,047 INFO L87 Difference]: Start difference. First operand 4023 states and 4607 transitions. Second operand has 37 states, 37 states have (on average 9.243243243243244) internal successors, (342), 36 states have internal predecessors, (342), 0 states have call successors, (0), 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:55:30,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~x4~0.offset 0)) (.cse0 (select |c_#valid| 0)) (.cse2 (+ 4 c_~x1~0.offset)) (.cse3 (+ c_~t4~0.offset 4))) (and (= .cse0 0) (= (select |c_#valid| c_~t4~0.base) 1) .cse1 (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (or .cse1 (= .cse0 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~t4~0.base) 4) 0) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1433) c_~x1~0.base) .cse2) 0)))) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1432) c_~x1~0.base) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (not (= c_~x1~0.base c_~t4~0.base)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1432) c_~t4~0.base) .cse3) 0)) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1433) c_~t4~0.base) .cse3) 0)) (= (select (select |c_#memory_$Pointer$#1.base| c_~t4~0.base) 4) 0))) is different from false [2025-03-17 11:55:33,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:35,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:39,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:40,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:41,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:43,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:44,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:47,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:48,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:50,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:51,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:52,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:53,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:55,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:56,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:58,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:55:59,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| 0))) (let ((.cse1 (= c_~t4~0.offset 0)) (.cse3 (= c_~x4~0.offset 0)) (.cse7 (+ 4 c_~x1~0.offset)) (.cse6 (= c_~S~0.base 0)) (.cse4 (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (.cse2 (= .cse0 1)) (.cse5 (= c_~S~0.offset 0))) (and (= .cse0 0) (or .cse1 .cse2) (= c_~t4~0.base 0) .cse3 .cse1 (= c_~x4~0.base 0) (or .cse4 .cse5) .cse6 (or .cse3 .cse2) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1433) c_~x1~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1432) c_~x1~0.base) .cse7) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (not (= 0 (select |c_#valid| c_~x1~0.base))) (or .cse6 .cse4) .cse5 (or .cse2 .cse5)))) is different from false [2025-03-17 11:56:01,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| 0))) (let ((.cse1 (= c_~t4~0.offset 0)) (.cse4 (= c_~x4~0.offset 0)) (.cse7 (+ 4 c_~x1~0.offset)) (.cse6 (= c_~S~0.base 0)) (.cse3 (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (.cse2 (= .cse0 1)) (.cse5 (= c_~S~0.offset 0))) (and (= .cse0 0) (or .cse1 .cse2) (= c_~t4~0.base 0) (or (= c_~t1~0.offset 0) .cse3) .cse4 .cse1 (= c_~x4~0.base 0) (or .cse3 .cse5) .cse6 (or .cse4 .cse2) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1433) c_~x1~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1432) c_~x1~0.base) .cse7) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (or .cse3 (= c_~t1~0.base 0)) (not (= 0 (select |c_#valid| c_~x1~0.base))) (or .cse6 .cse3) .cse5 (or .cse2 .cse5)))) is different from false [2025-03-17 11:56:02,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~x4~0.offset 0)) (.cse0 (select |c_#valid| 0)) (.cse1 (+ c_~S~0.offset 4)) (.cse3 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (= .cse0 0) (= (select |c_#valid| c_~t4~0.base) 1) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1433) c_~S~0.base) .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) .cse2 (= c_~t4~0.offset 0) (= c_~x4~0.base 0) (= c_~x1~0.offset 0) (or .cse2 (= .cse0 1)) (= c_~t1~0.base 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~t4~0.base) 4) 0) (not (= c_~x1~0.base c_~t4~0.base)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1432) c_~t4~0.base) .cse3) 0)) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1432) c_~S~0.base) .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1433) c_~t4~0.base) .cse3) 0)) (= (select (select |c_#memory_$Pointer$#1.base| c_~t4~0.base) 4) 0))) is different from false [2025-03-17 11:56:05,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4)) (.cse1 (+ c_~t4~0.offset 4))) (and (= 1 (select |c_#valid| c_~x1~0.base)) (= c_~t1~0.offset 0) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1433) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (= c_~x4~0.offset 0) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1433) c_~t4~0.base) .cse1) 0)))) (= c_~x4~0.base 0) (= c_~x1~0.offset 0) (= c_~t1~0.base 0) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1432) c_~t4~0.base) .cse1) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| c_~x1~0.base v_ArrVal_1432) c_~t4~0.base) .cse1) 0)) (forall ((|v_ULTIMATE.start_push_#t~malloc5#1.base_262| Int)) (or (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_push_#t~malloc5#1.base_262| v_ArrVal_1432) c_~S~0.base) .cse0) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_push_#t~malloc5#1.base_262|) 0)))) (forall ((v_ArrVal_1433 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| c_~x1~0.base v_ArrVal_1433) c_~t4~0.base) .cse1) 0)))) is different from false [2025-03-17 11:56:14,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:16,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:18,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:19,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:21,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:22,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:23,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:25,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:26,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:28,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:56:29,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]