./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.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/list-ext3-properties/sll_length_check-2.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 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:20:09,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:20:09,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:20:09,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:20:09,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:20:09,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:20:09,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:20:09,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:20:09,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:20:09,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:20:09,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:20:09,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:20:09,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:20:09,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:20:09,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:20:09,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:20:09,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:20:09,311 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 -> 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 [2025-03-17 12:20:09,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:20:09,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:20:09,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:20:09,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:20:09,530 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:20:09,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i [2025-03-17 12:20:10,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b169a24/3d382fc3c7c54fd98e539acec9e9fefe/FLAGb1df2d974 [2025-03-17 12:20:10,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:20:10,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i [2025-03-17 12:20:10,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b169a24/3d382fc3c7c54fd98e539acec9e9fefe/FLAGb1df2d974 [2025-03-17 12:20:10,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b169a24/3d382fc3c7c54fd98e539acec9e9fefe [2025-03-17 12:20:10,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:20:10,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:20:10,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:20:10,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:20:10,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:20:10,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb7a7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10, skipping insertion in model container [2025-03-17 12:20:10,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:20:11,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:20:11,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:20:11,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:20:11,289 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:20:11,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11 WrapperNode [2025-03-17 12:20:11,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:20:11,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:20:11,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:20:11,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:20:11,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,310 INFO L138 Inliner]: procedures = 125, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-03-17 12:20:11,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:20:11,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:20:11,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:20:11,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:20:11,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,328 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 12:20:11,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:20:11,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:20:11,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:20:11,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:20:11,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (1/1) ... [2025-03-17 12:20:11,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:20:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:11,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:20:11,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:20:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:20:11,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:20:11,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:20:11,462 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:20:11,579 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L579: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:20:11,591 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-17 12:20:11,591 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:20:11,597 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:20:11,597 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:20:11,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:20:11 BoogieIcfgContainer [2025-03-17 12:20:11,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:20:11,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:20:11,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:20:11,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:20:11,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:20:10" (1/3) ... [2025-03-17 12:20:11,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b56d51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:20:11, skipping insertion in model container [2025-03-17 12:20:11,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:11" (2/3) ... [2025-03-17 12:20:11,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b56d51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:20:11, skipping insertion in model container [2025-03-17 12:20:11,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:20:11" (3/3) ... [2025-03-17 12:20:11,605 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_length_check-2.i [2025-03-17 12:20:11,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:20:11,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_length_check-2.i that has 1 procedures, 38 locations, 1 initial locations, 4 loop locations, and 11 error locations. [2025-03-17 12:20:11,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:20:11,653 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;@54958e52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:20:11,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 12:20:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:20:11,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:11,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1870334444, now seen corresponding path program 1 times [2025-03-17 12:20:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113360102] [2025-03-17 12:20:11,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:11,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:20:11,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:20:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113360102] [2025-03-17 12:20:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113360102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:11,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:20:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206759224] [2025-03-17 12:20:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:20:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:20:11,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:20:11,800 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 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 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 12:20:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:11,810 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-17 12:20:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:20:11,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 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 12:20:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:11,817 INFO L225 Difference]: With dead ends: 37 [2025-03-17 12:20:11,817 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 12:20:11,819 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 12:20:11,821 INFO L435 NwaCegarLoop]: 42 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, 42 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 12:20:11,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 12:20:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 12:20:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-17 12:20:11,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 6 [2025-03-17 12:20:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:11,849 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-17 12:20:11,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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 12:20:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-17 12:20:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:20:11,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:20:11,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1467875793, now seen corresponding path program 1 times [2025-03-17 12:20:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646828327] [2025-03-17 12:20:11,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:11,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:20:11,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:20:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646828327] [2025-03-17 12:20:11,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646828327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:11,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:11,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:20:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134597222] [2025-03-17 12:20:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:20:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:20:11,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:20:11,967 INFO L87 Difference]: Start difference. First operand 34 states and 38 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 12:20:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,003 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-17 12:20:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:20:12,005 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 12:20:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,005 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:20:12,005 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 12:20:12,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:20:12,006 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 26 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:12,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 12:20:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2025-03-17 12:20:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-17 12:20:12,013 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 8 [2025-03-17 12:20:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,013 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-17 12:20:12,013 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 12:20:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-17 12:20:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:20:12,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:20:12,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:12,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1467884727, now seen corresponding path program 1 times [2025-03-17 12:20:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790277870] [2025-03-17 12:20:12,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:20:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:20:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790277870] [2025-03-17 12:20:12,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790277870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:12,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:12,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:20:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236824845] [2025-03-17 12:20:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:12,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:12,081 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.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 12:20:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,106 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-17 12:20:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.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 12:20:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,107 INFO L225 Difference]: With dead ends: 38 [2025-03-17 12:20:12,107 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 12:20:12,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:12,108 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 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 12:20:12,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 12:20:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 12:20:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-17 12:20:12,112 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 8 [2025-03-17 12:20:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,112 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-17 12:20:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.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 12:20:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-17 12:20:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:20:12,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:20:12,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:12,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1467884728, now seen corresponding path program 1 times [2025-03-17 12:20:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370614805] [2025-03-17 12:20:12,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:20:12,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:20:12,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370614805] [2025-03-17 12:20:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370614805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:12,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:12,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:20:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616867864] [2025-03-17 12:20:12,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:12,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:12,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:12,244 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 2 states have (on average 4.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 12:20:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,265 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-17 12:20:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.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 12:20:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,268 INFO L225 Difference]: With dead ends: 37 [2025-03-17 12:20:12,268 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 12:20:12,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:12,268 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:12,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 12:20:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 12:20:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-17 12:20:12,273 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 8 [2025-03-17 12:20:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,274 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-17 12:20:12,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.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 12:20:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-17 12:20:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:20:12,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:20:12,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2061070522, now seen corresponding path program 1 times [2025-03-17 12:20:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326287596] [2025-03-17 12:20:12,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:20:12,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:20:12,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326287596] [2025-03-17 12:20:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326287596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:12,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:20:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881527848] [2025-03-17 12:20:12,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:20:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:20:12,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:20:12,386 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 12:20:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,409 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-03-17 12:20:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:20:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 11 [2025-03-17 12:20:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,410 INFO L225 Difference]: With dead ends: 41 [2025-03-17 12:20:12,410 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 12:20:12,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:20:12,411 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:12,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 12:20:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-17 12:20:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-17 12:20:12,417 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2025-03-17 12:20:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,417 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-17 12:20:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 12:20:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-03-17 12:20:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:20:12,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:20:12,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:12,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1843449395, now seen corresponding path program 1 times [2025-03-17 12:20:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101579223] [2025-03-17 12:20:12,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:20:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:20:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101579223] [2025-03-17 12:20:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101579223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75662406] [2025-03-17 12:20:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:12,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:12,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:20:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:20:12,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:20:12,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:20:12,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:12,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75662406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:12,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:12,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 12:20:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655114166] [2025-03-17 12:20:12,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:20:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:20:12,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:12,634 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,691 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-17 12:20:12,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:20:12,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 12:20:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,693 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:20:12,693 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 12:20:12,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:20:12,694 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:12,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 12:20:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2025-03-17 12:20:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 36 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 12:20:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-03-17 12:20:12,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 12 [2025-03-17 12:20:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-03-17 12:20:12,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-03-17 12:20:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:20:12,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:20:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 12:20:12,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:12,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1016948331, now seen corresponding path program 2 times [2025-03-17 12:20:12,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591168419] [2025-03-17 12:20:12,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 12:20:12,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:20:12,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591168419] [2025-03-17 12:20:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591168419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:20:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921304436] [2025-03-17 12:20:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:20:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:20:12,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:20:12,994 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:13,047 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-03-17 12:20:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:20:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:13,048 INFO L225 Difference]: With dead ends: 39 [2025-03-17 12:20:13,048 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 12:20:13,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:20:13,048 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:13,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 12:20:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 12:20:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.5) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-17 12:20:13,050 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 16 [2025-03-17 12:20:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:13,051 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-17 12:20:13,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-17 12:20:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:20:13,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:13,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:13,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:20:13,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:13,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1016948330, now seen corresponding path program 1 times [2025-03-17 12:20:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889705013] [2025-03-17 12:20:13,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:20:13,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:20:13,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:13,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:20:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889705013] [2025-03-17 12:20:13,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889705013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:13,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:13,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:20:13,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490322228] [2025-03-17 12:20:13,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:20:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:13,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:20:13,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:20:13,208 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:13,258 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-17 12:20:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:20:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:13,260 INFO L225 Difference]: With dead ends: 39 [2025-03-17 12:20:13,260 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 12:20:13,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:20:13,263 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:13,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 12:20:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 12:20:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-17 12:20:13,272 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 16 [2025-03-17 12:20:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:13,272 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-17 12:20:13,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-17 12:20:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 12:20:13,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:13,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:13,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:20:13,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:13,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1965045268, now seen corresponding path program 1 times [2025-03-17 12:20:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168704562] [2025-03-17 12:20:13,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:13,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:13,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 12:20:13,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 12:20:13,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:13,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:20:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168704562] [2025-03-17 12:20:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168704562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:13,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:20:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426614602] [2025-03-17 12:20:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:13,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:20:13,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:13,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:20:13,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:20:13,333 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:13,360 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-17 12:20:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-17 12:20:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:13,361 INFO L225 Difference]: With dead ends: 39 [2025-03-17 12:20:13,361 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 12:20:13,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:20:13,362 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:13,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 12:20:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 12:20:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-03-17 12:20:13,364 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2025-03-17 12:20:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-03-17 12:20:13,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-03-17 12:20:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:20:13,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:13,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:13,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:20:13,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 791575302, now seen corresponding path program 1 times [2025-03-17 12:20:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598032289] [2025-03-17 12:20:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:13,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:20:13,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:20:13,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:13,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598032289] [2025-03-17 12:20:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598032289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825623691] [2025-03-17 12:20:13,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:13,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:13,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:20:13,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:20:13,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:20:13,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:13,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:13,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:20:13,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:13,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:13,722 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:20:13,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:20:13,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:20:13,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:13,876 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:13,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:20:13,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:20:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:13,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:14,075 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 12:20:14,080 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 22 treesize of output 20 [2025-03-17 12:20:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825623691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:14,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 12:20:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833301580] [2025-03-17 12:20:14,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:20:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:14,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:20:14,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:20:14,265 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:14,542 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-17 12:20:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:20:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 12:20:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:14,543 INFO L225 Difference]: With dead ends: 44 [2025-03-17 12:20:14,543 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 12:20:14,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-17 12:20:14,544 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:14,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 278 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:20:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 12:20:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-17 12:20:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 41 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 12:20:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-03-17 12:20:14,546 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 19 [2025-03-17 12:20:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:14,546 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-03-17 12:20:14,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-03-17 12:20:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:20:14,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:14,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:14,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:14,747 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,SelfDestructingSolverStorable9 [2025-03-17 12:20:14,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:14,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 791575303, now seen corresponding path program 1 times [2025-03-17 12:20:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930337869] [2025-03-17 12:20:14,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:14,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:20:14,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:20:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:15,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930337869] [2025-03-17 12:20:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930337869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:15,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893338458] [2025-03-17 12:20:15,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:15,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:15,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:15,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:15,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:20:15,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:20:15,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:20:15,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:15,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:15,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 12:20:15,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:15,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:15,086 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 12:20:15,148 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:20:15,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:20:15,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:20:15,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:20:15,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:15,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:15,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:20:15,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:20:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:15,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893338458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:15,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-03-17 12:20:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264993042] [2025-03-17 12:20:15,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:15,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 12:20:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:15,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 12:20:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2025-03-17 12:20:15,682 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:15,956 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-17 12:20:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:20:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 12:20:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:15,957 INFO L225 Difference]: With dead ends: 44 [2025-03-17 12:20:15,957 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 12:20:15,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:20:15,958 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:15,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 350 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:20:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 12:20:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-17 12:20:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-17 12:20:15,961 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2025-03-17 12:20:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:15,961 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-17 12:20:15,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-17 12:20:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:20:15,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:15,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:15,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:20:16,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:16,164 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:16,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash 494501701, now seen corresponding path program 1 times [2025-03-17 12:20:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301322437] [2025-03-17 12:20:16,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:16,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:20:16,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:20:16,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:16,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301322437] [2025-03-17 12:20:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301322437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370943232] [2025-03-17 12:20:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:16,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:16,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:20:16,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:20:16,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:20:16,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:16,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:16,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 12:20:16,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:16,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370943232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:16,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2025-03-17 12:20:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970773346] [2025-03-17 12:20:16,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:20:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:16,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:20:16,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:20:16,380 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 12:20:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:16,481 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-03-17 12:20:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:20:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 21 [2025-03-17 12:20:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:16,482 INFO L225 Difference]: With dead ends: 44 [2025-03-17 12:20:16,482 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 12:20:16,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:20:16,483 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:16,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 12:20:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 12:20:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-03-17 12:20:16,485 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2025-03-17 12:20:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:16,485 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-17 12:20:16,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 12:20:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-03-17 12:20:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:20:16,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:16,485 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:16,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:16,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:16,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:16,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1845602315, now seen corresponding path program 2 times [2025-03-17 12:20:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210956460] [2025-03-17 12:20:16,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:16,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 12:20:16,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:20:16,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:16,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210956460] [2025-03-17 12:20:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210956460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173963583] [2025-03-17 12:20:16,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:16,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:16,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:16,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:16,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:20:17,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 12:20:17,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:20:17,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:17,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:17,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-17 12:20:17,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:17,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:17,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:17,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:17,165 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:20:17,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:20:17,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:20:17,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:20:17,445 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:17,450 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-03-17 12:20:17,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2025-03-17 12:20:17,457 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:20:17,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-03-17 12:20:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:17,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:18,088 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 62 treesize of output 58 [2025-03-17 12:20:18,169 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 62 treesize of output 58 [2025-03-17 12:20:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:18,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173963583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:18,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:18,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 31 [2025-03-17 12:20:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216423888] [2025-03-17 12:20:18,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:18,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 12:20:18,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:18,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 12:20:18,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2025-03-17 12:20:18,386 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:18,931 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-17 12:20:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:20:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:20:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:18,931 INFO L225 Difference]: With dead ends: 57 [2025-03-17 12:20:18,931 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 12:20:18,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 12:20:18,932 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:18,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 616 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:20:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 12:20:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-03-17 12:20:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-03-17 12:20:18,935 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 22 [2025-03-17 12:20:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:18,935 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-03-17 12:20:18,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-03-17 12:20:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:20:18,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:18,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:18,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:20:19,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 12:20:19,136 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1850388895, now seen corresponding path program 1 times [2025-03-17 12:20:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:19,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945820089] [2025-03-17 12:20:19,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:19,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:20:19,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:20:19,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:19,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945820089] [2025-03-17 12:20:19,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945820089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:19,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857652671] [2025-03-17 12:20:19,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:19,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:19,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:19,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:19,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:20:19,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:20:19,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:20:19,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:19,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:19,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 12:20:19,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:19,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:19,369 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:19,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:19,371 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 16 treesize of output 11 [2025-03-17 12:20:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:19,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:19,454 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 11 treesize of output 9 [2025-03-17 12:20:19,457 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 20 treesize of output 18 [2025-03-17 12:20:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857652671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:19,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-17 12:20:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770183568] [2025-03-17 12:20:19,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:19,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 12:20:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:19,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 12:20:19,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:20:19,485 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:19,628 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-03-17 12:20:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:20:19,628 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:20:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:19,628 INFO L225 Difference]: With dead ends: 54 [2025-03-17 12:20:19,629 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 12:20:19,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-17 12:20:19,629 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:19,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 374 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 12:20:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 12:20:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.326086956521739) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-17 12:20:19,631 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2025-03-17 12:20:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:19,631 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-17 12:20:19,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-17 12:20:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:20:19,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:19,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:19,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 12:20:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:19,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash 197516405, now seen corresponding path program 1 times [2025-03-17 12:20:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832816176] [2025-03-17 12:20:19,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:19,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:20:19,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:20:19,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832816176] [2025-03-17 12:20:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832816176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:20:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447960130] [2025-03-17 12:20:19,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:19,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:20:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:19,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:20:19,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:20:19,941 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:19,991 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-03-17 12:20:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:20:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 12:20:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:19,991 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:20:19,991 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 12:20:19,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:19,992 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:19,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 12:20:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 12:20:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 55 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 12:20:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2025-03-17 12:20:19,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 24 [2025-03-17 12:20:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:19,993 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2025-03-17 12:20:19,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2025-03-17 12:20:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:20:19,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:19,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:19,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:20:19,994 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 197516045, now seen corresponding path program 1 times [2025-03-17 12:20:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757312385] [2025-03-17 12:20:19,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:20:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:20:20,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:20,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757312385] [2025-03-17 12:20:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757312385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:20:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609740931] [2025-03-17 12:20:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:20:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:20,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:20:20,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:20:20,053 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:20,085 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-03-17 12:20:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:20:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 12:20:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:20,086 INFO L225 Difference]: With dead ends: 58 [2025-03-17 12:20:20,086 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 12:20:20,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:20,086 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:20,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 111 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 12:20:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-03-17 12:20:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-17 12:20:20,092 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 24 [2025-03-17 12:20:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:20,092 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-17 12:20:20,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-17 12:20:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:20:20,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:20,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:20:20,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1827968786, now seen corresponding path program 2 times [2025-03-17 12:20:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371807633] [2025-03-17 12:20:20,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:20,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 12:20:20,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:20:20,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:20,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371807633] [2025-03-17 12:20:20,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371807633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:20,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804821937] [2025-03-17 12:20:20,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:20,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:20,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:20,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:20,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:20:20,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 12:20:20,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:20:20,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:20,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 12:20:20,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:20,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804821937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:20,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 12:20:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149578427] [2025-03-17 12:20:20,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:20,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 12:20:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:20,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 12:20:20,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:20:20,300 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:20,331 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-03-17 12:20:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:20:20,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 12:20:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:20,332 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:20:20,332 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:20:20,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:20:20,332 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:20,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 193 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:20:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2025-03-17 12:20:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.225) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2025-03-17 12:20:20,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 25 [2025-03-17 12:20:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:20,337 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2025-03-17 12:20:20,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2025-03-17 12:20:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:20:20,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:20,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:20,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:20:20,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:20,538 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 327864535, now seen corresponding path program 3 times [2025-03-17 12:20:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255186411] [2025-03-17 12:20:20,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:20:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:20,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-17 12:20:20,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:20:20,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:20:20,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255186411] [2025-03-17 12:20:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255186411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757105705] [2025-03-17 12:20:20,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:20:20,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:20,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:20,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:20:20,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-17 12:20:20,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:20:20,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:20:20,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 12:20:20,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:20,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:20:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757105705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:20,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:20:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 12:20:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234820710] [2025-03-17 12:20:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:20:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:20,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:20:20,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:20:20,730 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:20,760 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-03-17 12:20:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:20,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 12:20:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:20,761 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:20:20,761 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:20:20,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:20:20,761 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:20,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:20:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 12:20:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-17 12:20:20,763 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2025-03-17 12:20:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-17 12:20:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-17 12:20:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:20:20,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:20,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:20,770 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 12:20:20,964 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,SelfDestructingSolverStorable17 [2025-03-17 12:20:20,965 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:20,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash 105983069, now seen corresponding path program 1 times [2025-03-17 12:20:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753797728] [2025-03-17 12:20:20,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:20,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:20:20,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:20:20,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:20,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753797728] [2025-03-17 12:20:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753797728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:20:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744811436] [2025-03-17 12:20:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:21,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:20:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:21,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:20:21,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:20:21,029 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:21,066 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-03-17 12:20:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:20:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:20:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:21,067 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:20:21,067 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:20:21,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:21,068 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:21,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 103 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:20:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 12:20:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-03-17 12:20:21,070 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 27 [2025-03-17 12:20:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-03-17 12:20:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-03-17 12:20:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:20:21,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:21,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:20:21,071 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1954808381, now seen corresponding path program 1 times [2025-03-17 12:20:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525456508] [2025-03-17 12:20:21,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:21,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:20:21,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:20:21,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:21,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525456508] [2025-03-17 12:20:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525456508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297930405] [2025-03-17 12:20:21,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:21,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:21,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:21,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:20:21,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:20:21,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:20:21,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:21,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:21,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 12:20:21,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:21,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297930405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:21,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-17 12:20:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91387681] [2025-03-17 12:20:21,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:20:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:21,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:20:21,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:20:21,262 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:21,310 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-03-17 12:20:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:20:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:20:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:21,311 INFO L225 Difference]: With dead ends: 71 [2025-03-17 12:20:21,311 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 12:20:21,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:20:21,311 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:21,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 145 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 12:20:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 12:20:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2025-03-17 12:20:21,315 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 28 [2025-03-17 12:20:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:21,315 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2025-03-17 12:20:21,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2025-03-17 12:20:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:20:21,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:21,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:21,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:21,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:21,520 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:21,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:21,521 INFO L85 PathProgramCache]: Analyzing trace with hash -35075316, now seen corresponding path program 1 times [2025-03-17 12:20:21,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:21,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461269819] [2025-03-17 12:20:21,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:21,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:20:21,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:20:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:21,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:21,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461269819] [2025-03-17 12:20:21,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461269819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:21,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021590688] [2025-03-17 12:20:21,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:21,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:21,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:21,816 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:21,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:20:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:20:21,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:20:21,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:21,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:21,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 12:20:21,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:21,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:21,914 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:20:21,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:20:21,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:21,993 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2025-03-17 12:20:21,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2025-03-17 12:20:22,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:22,037 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 41 treesize of output 21 [2025-03-17 12:20:22,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:20:22,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:20:22,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 25 [2025-03-17 12:20:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:22,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:22,765 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 82 treesize of output 78 [2025-03-17 12:20:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021590688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:23,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2025-03-17 12:20:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849946492] [2025-03-17 12:20:23,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 12:20:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 12:20:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 12:20:23,051 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 36 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 12:20:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:23,587 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2025-03-17 12:20:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:20:23,587 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 36 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 29 [2025-03-17 12:20:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:23,588 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:20:23,588 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:20:23,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=1774, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 12:20:23,589 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:23,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 426 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:20:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:20:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-17 12:20:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 73 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 12:20:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2025-03-17 12:20:23,591 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2025-03-17 12:20:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-03-17 12:20:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 36 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 12:20:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2025-03-17 12:20:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:20:23,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:23,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:23,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:23,792 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,SelfDestructingSolverStorable20 [2025-03-17 12:20:23,792 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:23,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash -35075315, now seen corresponding path program 1 times [2025-03-17 12:20:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199482641] [2025-03-17 12:20:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:23,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:20:23,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:20:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199482641] [2025-03-17 12:20:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199482641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528583080] [2025-03-17 12:20:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:24,188 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:24,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:20:24,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:20:24,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:20:24,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:24,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-17 12:20:24,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:24,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:24,277 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 12:20:24,334 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:20:24,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:20:24,350 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:20:24,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:20:24,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:24,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:24,472 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 12:20:24,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 12:20:24,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:20:24,527 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 57 treesize of output 29 [2025-03-17 12:20:24,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:20:24,751 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:24,762 INFO L349 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2025-03-17 12:20:24,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 41 [2025-03-17 12:20:24,773 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:20:24,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-03-17 12:20:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:24,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:25,468 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 Int) (v_ArrVal_517 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_58| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_40| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_520) (< |v_ULTIMATE.start_sll_length_~head#1.offset_40| 0) (< v_ArrVal_520 |v_ULTIMATE.start_sll_length_~head#1.offset_40|) (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58|) 0 v_ArrVal_520)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_40|)) (select (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58| v_ArrVal_517) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_40|))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58|))))) (forall ((v_ArrVal_520 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_58| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_40| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_520) (< |v_ULTIMATE.start_sll_length_~head#1.offset_40| 0) (< v_ArrVal_520 |v_ULTIMATE.start_sll_length_~head#1.offset_40|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58|) 0 v_ArrVal_520)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_40|) 1)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_58|)))))) is different from false [2025-03-17 12:20:25,480 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 70 treesize of output 66 [2025-03-17 12:20:25,534 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 202 treesize of output 198 [2025-03-17 12:20:25,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:25,550 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 542 treesize of output 526 [2025-03-17 12:20:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-03-17 12:20:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528583080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:26,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:26,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-03-17 12:20:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637060737] [2025-03-17 12:20:26,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:26,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 12:20:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:26,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 12:20:26,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1537, Unknown=1, NotChecked=78, Total=1722 [2025-03-17 12:20:26,398 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 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 12:20:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:27,396 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-03-17 12:20:27,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:20:27,397 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 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 29 [2025-03-17 12:20:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:27,397 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:20:27,397 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:20:27,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=242, Invalid=2413, Unknown=1, NotChecked=100, Total=2756 [2025-03-17 12:20:27,399 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:27,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 665 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 862 Invalid, 0 Unknown, 35 Unchecked, 0.5s Time] [2025-03-17 12:20:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:20:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-17 12:20:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 73 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 12:20:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-03-17 12:20:27,400 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 29 [2025-03-17 12:20:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:27,400 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-03-17 12:20:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 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 12:20:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-03-17 12:20:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:20:27,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:27,402 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:27,407 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 12:20:27,602 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,SelfDestructingSolverStorable21 [2025-03-17 12:20:27,602 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash 540627469, now seen corresponding path program 1 times [2025-03-17 12:20:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123164992] [2025-03-17 12:20:27,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:27,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:20:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:20:27,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:27,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123164992] [2025-03-17 12:20:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123164992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017522818] [2025-03-17 12:20:27,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:27,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:27,800 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 12:20:27,801 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 12:20:27,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:20:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:20:27,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:27,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:27,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 12:20:27,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:27,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:27,891 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:20:27,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:20:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:28,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:28,050 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 25 treesize of output 21 [2025-03-17 12:20:28,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:20:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:28,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:28,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:28,229 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 25 treesize of output 29 [2025-03-17 12:20:28,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 12:20:28,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 12:20:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017522818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:28,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 31 [2025-03-17 12:20:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963582013] [2025-03-17 12:20:28,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:20:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:28,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:20:28,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:20:28,377 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:28,815 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-03-17 12:20:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:20:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:20:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:28,815 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:20:28,815 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:20:28,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1736, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 12:20:28,816 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:28,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 339 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:20:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:20:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 12:20:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-03-17 12:20:28,818 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2025-03-17 12:20:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:28,818 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-03-17 12:20:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-03-17 12:20:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:20:28,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:28,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:28,824 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 12:20:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 12:20:29,019 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:29,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash 540627470, now seen corresponding path program 1 times [2025-03-17 12:20:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106354303] [2025-03-17 12:20:29,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:29,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:20:29,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:20:29,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:29,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106354303] [2025-03-17 12:20:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106354303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318959276] [2025-03-17 12:20:29,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:29,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:29,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:29,218 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 12:20:29,219 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 12:20:29,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:20:29,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:20:29,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:29,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:29,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 12:20:29,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:29,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:29,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:29,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:29,437 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 17 treesize of output 17 [2025-03-17 12:20:29,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:29,443 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 15 treesize of output 15 [2025-03-17 12:20:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:29,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:29,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:29,700 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 31 treesize of output 35 [2025-03-17 12:20:29,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 12:20:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 12:20:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318959276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:29,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:29,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 37 [2025-03-17 12:20:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089374184] [2025-03-17 12:20:29,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:29,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 12:20:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:29,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 12:20:29,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1303, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 12:20:29,948 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:30,363 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-17 12:20:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:20:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:20:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:30,365 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:20:30,365 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:20:30,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1994, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 12:20:30,366 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:30,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 435 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:20:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:20:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 12:20:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-03-17 12:20:30,367 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2025-03-17 12:20:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:30,367 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-03-17 12:20:30,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-03-17 12:20:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:20:30,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:30,369 INFO L218 NwaCegarLoop]: trace histogram [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 12:20:30,375 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 12:20:30,569 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,SelfDestructingSolverStorable23 [2025-03-17 12:20:30,569 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 540627110, now seen corresponding path program 1 times [2025-03-17 12:20:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268903766] [2025-03-17 12:20:30,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:30,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:30,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:20:30,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:20:30,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:30,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268903766] [2025-03-17 12:20:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268903766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494325585] [2025-03-17 12:20:30,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:30,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:30,667 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 12:20:30,669 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 12:20:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:20:30,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:20:30,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:30,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:30,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 12:20:30,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:30,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:30,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:30,825 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 16 treesize of output 16 [2025-03-17 12:20:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:30,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:30,910 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 11 treesize of output 9 [2025-03-17 12:20:30,911 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 20 treesize of output 18 [2025-03-17 12:20:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494325585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:30,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 20 [2025-03-17 12:20:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69201144] [2025-03-17 12:20:30,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:20:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:30,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:20:30,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:20:30,920 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:31,130 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-03-17 12:20:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:20:31,130 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:20:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:31,131 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:20:31,131 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:20:31,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2025-03-17 12:20:31,131 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:31,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 393 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:20:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-03-17 12:20:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 78 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-03-17 12:20:31,133 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 30 [2025-03-17 12:20:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:31,133 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-03-17 12:20:31,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-03-17 12:20:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:20:31,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:31,133 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:31,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:31,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:31,334 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:31,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1251687889, now seen corresponding path program 2 times [2025-03-17 12:20:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:31,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710263727] [2025-03-17 12:20:31,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:31,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 12:20:31,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:20:31,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:31,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710263727] [2025-03-17 12:20:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710263727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823164965] [2025-03-17 12:20:31,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:31,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:31,843 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 12:20:31,844 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 12:20:31,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 12:20:31,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:20:31,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:31,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 12:20:31,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:31,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:31,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:32,002 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:20:32,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:20:32,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:20:32,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:20:32,129 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-17 12:20:32,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 12:20:32,184 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-17 12:20:32,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 44 [2025-03-17 12:20:32,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-03-17 12:20:32,665 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:32,690 INFO L349 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2025-03-17 12:20:32,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 62 [2025-03-17 12:20:32,703 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-17 12:20:32,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2025-03-17 12:20:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:32,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:37,896 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0)) (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687)))) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|)) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_687) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0) (< (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0)) (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int)) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_687) (= (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|))) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|)))))) is different from false [2025-03-17 12:20:37,943 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|))) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_687) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0)) (< (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0))) (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687)))) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (= (select (select .cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|)) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_687) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0)) (< (select (select .cse1 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0))))) is different from false [2025-03-17 12:20:38,349 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_683) (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|))) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 v_ArrVal_683)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) (< 0 v_ArrVal_687) (= 0 (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|))))) (select .cse1 (select (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|))) |v_ULTIMATE.start_sll_length_~head#1.offset_58|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| Int)) (or (forall ((v_ArrVal_683 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_683) (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 v_ArrVal_683)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687))))) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0)) (= (select (select .cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|)) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0) (< (select (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) (< 0 v_ArrVal_687)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0))))) is different from false [2025-03-17 12:20:38,436 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 v_ArrVal_683)))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687))))) (or (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_683) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0) (< (select (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) (= (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|)) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< 0 v_ArrVal_687)))) (forall ((v_ArrVal_687 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_59| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_58| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| Int)) (or (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|))))) (select .cse3 (select (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|))) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) 0) (< v_ArrVal_687 |v_ULTIMATE.start_sll_length_~head#1.offset_59|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_59| 0) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_683) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_58| 0) (< (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) 0 v_ArrVal_683)))) (store .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80| (store (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_80|) 0 v_ArrVal_687))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_81|) |v_ULTIMATE.start_sll_length_~head#1.offset_59|) |v_ULTIMATE.start_sll_length_~head#1.offset_58|) (< 0 v_ArrVal_687)))) is different from false [2025-03-17 12:20:38,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:20:38,470 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 2261 treesize of output 2133 [2025-03-17 12:20:38,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:20:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:20:38,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:38,679 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:38,685 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 1102 treesize of output 1070 [2025-03-17 12:20:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2025-03-17 12:20:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823164965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:39,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 49 [2025-03-17 12:20:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292521621] [2025-03-17 12:20:39,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:39,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 12:20:39,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:39,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 12:20:39,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1878, Unknown=5, NotChecked=356, Total=2352 [2025-03-17 12:20:39,210 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 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 12:20:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:40,953 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2025-03-17 12:20:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:20:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 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) Word has length 32 [2025-03-17 12:20:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:40,954 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:20:40,954 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:20:40,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=187, Invalid=3246, Unknown=5, NotChecked=468, Total=3906 [2025-03-17 12:20:40,955 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:40,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 955 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1243 Invalid, 0 Unknown, 178 Unchecked, 0.8s Time] [2025-03-17 12:20:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:20:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-03-17 12:20:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.2) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2025-03-17 12:20:40,957 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 32 [2025-03-17 12:20:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2025-03-17 12:20:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.530612244897959) internal successors, (75), 49 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 12:20:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2025-03-17 12:20:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:20:40,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:40,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:40,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 12:20:41,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 12:20:41,162 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1256474469, now seen corresponding path program 2 times [2025-03-17 12:20:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572855880] [2025-03-17 12:20:41,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:41,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 12:20:41,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:20:41,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:41,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572855880] [2025-03-17 12:20:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572855880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636206504] [2025-03-17 12:20:41,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:41,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:41,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:41,367 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 12:20:41,369 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 12:20:41,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 12:20:41,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:20:41,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:41,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:41,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 12:20:41,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:41,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:41,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:41,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:20:41,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:20:41,570 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 28 treesize of output 16 [2025-03-17 12:20:41,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:41,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:20:41,729 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:20:41,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-03-17 12:20:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:41,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:41,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 12:20:41,946 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 12:20:42,148 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 66 treesize of output 62 [2025-03-17 12:20:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:42,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636206504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:42,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 32 [2025-03-17 12:20:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008931675] [2025-03-17 12:20:42,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:20:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:42,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:20:42,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:20:42,270 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:42,774 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2025-03-17 12:20:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:20:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 12:20:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:42,775 INFO L225 Difference]: With dead ends: 93 [2025-03-17 12:20:42,775 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 12:20:42,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 12:20:42,776 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:42,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 668 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:20:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 12:20:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 12:20:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-03-17 12:20:42,778 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 32 [2025-03-17 12:20:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:42,778 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-03-17 12:20:42,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-03-17 12:20:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:20:42,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:42,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:42,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:42,979 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,SelfDestructingSolverStorable26 [2025-03-17 12:20:42,979 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash -294443996, now seen corresponding path program 1 times [2025-03-17 12:20:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134079735] [2025-03-17 12:20:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:42,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:20:42,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:20:42,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:42,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134079735] [2025-03-17 12:20:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134079735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931664158] [2025-03-17 12:20:43,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:43,111 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 12:20:43,113 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 12:20:43,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:20:43,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:20:43,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:43,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:43,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 12:20:43,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:43,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:43,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:43,295 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 17 treesize of output 17 [2025-03-17 12:20:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:43,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:43,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 12:20:43,459 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 12:20:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931664158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:43,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 19 [2025-03-17 12:20:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220726457] [2025-03-17 12:20:43,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:43,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:20:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:43,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:20:43,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:20:43,470 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:43,702 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-03-17 12:20:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:20:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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 33 [2025-03-17 12:20:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:43,703 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:20:43,703 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:20:43,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2025-03-17 12:20:43,703 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:43,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 284 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:20:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:20:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-03-17 12:20:43,705 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 33 [2025-03-17 12:20:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:43,705 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-03-17 12:20:43,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-03-17 12:20:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:20:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:43,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:43,712 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 12:20:43,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 12:20:43,906 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:43,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash -132625768, now seen corresponding path program 3 times [2025-03-17 12:20:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801961902] [2025-03-17 12:20:43,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:20:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:43,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-03-17 12:20:43,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:20:43,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:20:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:20:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801961902] [2025-03-17 12:20:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801961902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970032348] [2025-03-17 12:20:44,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:20:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:44,007 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 12:20:44,009 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 12:20:44,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-03-17 12:20:44,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:20:44,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:20:44,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:44,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 12:20:44,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:20:44,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:20:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970032348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:44,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-17 12:20:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352219415] [2025-03-17 12:20:44,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:20:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:44,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:20:44,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:20:44,195 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 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 12:20:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:44,261 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2025-03-17 12:20:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:20:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 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 35 [2025-03-17 12:20:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:44,262 INFO L225 Difference]: With dead ends: 142 [2025-03-17 12:20:44,262 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 12:20:44,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:20:44,263 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:44,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 347 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 12:20:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2025-03-17 12:20:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2025-03-17 12:20:44,264 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 35 [2025-03-17 12:20:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2025-03-17 12:20:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 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 12:20:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2025-03-17 12:20:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:20:44,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:44,265 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:44,273 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 12:20:44,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:20:44,465 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1457884954, now seen corresponding path program 2 times [2025-03-17 12:20:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581959021] [2025-03-17 12:20:44,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:44,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:20:44,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:44,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:44,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 12:20:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581959021] [2025-03-17 12:20:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581959021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142589088] [2025-03-17 12:20:44,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:44,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:44,702 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 12:20:44,704 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 12:20:44,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:20:44,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:44,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:44,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:44,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-17 12:20:44,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:44,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:20:44,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:44,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:20:44,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:20:44,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:20:44,906 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 20 treesize of output 15 [2025-03-17 12:20:44,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:20:45,235 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-03-17 12:20:45,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2025-03-17 12:20:45,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:45,242 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 15 treesize of output 15 [2025-03-17 12:20:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:20:45,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:45,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1) 0) 0) (forall ((v_ArrVal_866 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_866) .cse1) 0) 0))))) is different from false [2025-03-17 12:20:46,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:46,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-17 12:20:46,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:46,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-03-17 12:20:46,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:20:46,428 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:46,432 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 16 [2025-03-17 12:20:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-03-17 12:20:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142589088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:46,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 19] total 46 [2025-03-17 12:20:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460676161] [2025-03-17 12:20:46,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 12:20:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:46,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 12:20:46,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1871, Unknown=1, NotChecked=86, Total=2070 [2025-03-17 12:20:46,504 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:47,438 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2025-03-17 12:20:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 12:20:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 12:20:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:47,440 INFO L225 Difference]: With dead ends: 149 [2025-03-17 12:20:47,440 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 12:20:47,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=204, Invalid=3221, Unknown=1, NotChecked=114, Total=3540 [2025-03-17 12:20:47,441 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:47,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 621 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1109 Invalid, 0 Unknown, 47 Unchecked, 0.5s Time] [2025-03-17 12:20:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 12:20:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-17 12:20:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2025-03-17 12:20:47,445 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 36 [2025-03-17 12:20:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:47,445 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2025-03-17 12:20:47,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2025-03-17 12:20:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:20:47,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:47,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:47,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:47,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:47,647 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:47,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1457885313, now seen corresponding path program 2 times [2025-03-17 12:20:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702579961] [2025-03-17 12:20:47,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:47,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:20:47,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:47,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:47,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702579961] [2025-03-17 12:20:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702579961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749430530] [2025-03-17 12:20:47,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:47,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:47,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:47,954 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 12:20:47,956 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 12:20:48,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:20:48,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:48,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:48,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:48,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 12:20:48,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:48,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:20:48,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:48,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2025-03-17 12:20:48,462 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_30| Int) (|v_ULTIMATE.start_sll_destroy_~head#1.base_29| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_30|) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_30| 1) |v_ULTIMATE.start_sll_destroy_~head#1.base_29|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_sll_destroy_~head#1.base_29| 0) |v_ULTIMATE.start_sll_destroy_~head#1.base_30| 0)))) is different from true [2025-03-17 12:20:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2025-03-17 12:20:48,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:48,641 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 18 [2025-03-17 12:20:48,643 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 38 treesize of output 36 [2025-03-17 12:20:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749430530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:57,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-17 12:20:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480058542] [2025-03-17 12:20:57,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:57,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 12:20:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:57,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 12:20:57,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1167, Unknown=2, NotChecked=68, Total=1332 [2025-03-17 12:20:57,461 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:58,155 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2025-03-17 12:20:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:20:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 12:20:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:58,156 INFO L225 Difference]: With dead ends: 150 [2025-03-17 12:20:58,156 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 12:20:58,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=145, Invalid=1749, Unknown=2, NotChecked=84, Total=1980 [2025-03-17 12:20:58,157 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:58,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 448 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 687 Invalid, 0 Unknown, 61 Unchecked, 0.4s Time] [2025-03-17 12:20:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 12:20:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-17 12:20:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 110 states have (on average 1.1727272727272726) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2025-03-17 12:20:58,159 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 36 [2025-03-17 12:20:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:58,159 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2025-03-17 12:20:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2025-03-17 12:20:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:20:58,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:58,160 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:58,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-17 12:20:58,361 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,SelfDestructingSolverStorable30 [2025-03-17 12:20:58,361 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -597812851, now seen corresponding path program 3 times [2025-03-17 12:20:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547371168] [2025-03-17 12:20:58,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:20:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:58,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-03-17 12:20:58,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:58,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 12:20:58,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:20:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547371168] [2025-03-17 12:20:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547371168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030170268] [2025-03-17 12:20:58,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:20:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:58,451 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 12:20:58,456 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 12:20:58,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-03-17 12:20:58,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:58,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 12:20:58,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:58,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 12:20:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:20:58,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 12:20:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030170268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:58,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:58,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-17 12:20:58,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978601395] [2025-03-17 12:20:58,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:58,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:20:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:58,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:20:58,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:20:58,672 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:58,735 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-03-17 12:20:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:20:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2025-03-17 12:20:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:58,736 INFO L225 Difference]: With dead ends: 104 [2025-03-17 12:20:58,736 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 12:20:58,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-17 12:20:58,736 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:58,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 157 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 12:20:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 12:20:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 103 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-03-17 12:20:58,740 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 36 [2025-03-17 12:20:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:58,740 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-03-17 12:20:58,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-03-17 12:20:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:20:58,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:58,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:58,747 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 12:20:58,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:58,941 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:58,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1308099581, now seen corresponding path program 4 times [2025-03-17 12:20:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:58,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609982251] [2025-03-17 12:20:58,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:20:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:58,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 12:20:58,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:20:58,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:20:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:20:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609982251] [2025-03-17 12:20:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609982251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363399428] [2025-03-17 12:20:59,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:20:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:59,032 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 12:20:59,034 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 12:20:59,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 12:20:59,134 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:20:59,134 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 12:20:59,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:59,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 12:20:59,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:20:59,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:20:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363399428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:59,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-03-17 12:20:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682991547] [2025-03-17 12:20:59,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:59,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:20:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:20:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:20:59,199 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:59,279 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-03-17 12:20:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:20:59,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 12:20:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:59,280 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:20:59,280 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:20:59,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-17 12:20:59,280 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:59,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 218 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:20:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 12:20:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-03-17 12:20:59,282 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 38 [2025-03-17 12:20:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:59,282 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-03-17 12:20:59,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-03-17 12:20:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:20:59,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:59,282 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 12:20:59,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 12:20:59,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:59,487 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:20:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1617204610, now seen corresponding path program 4 times [2025-03-17 12:20:59,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:59,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306701166] [2025-03-17 12:20:59,487 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:20:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:59,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-17 12:20:59,503 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 39 statements. [2025-03-17 12:20:59,503 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 12:20:59,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:20:59,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306701166] [2025-03-17 12:20:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306701166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653417222] [2025-03-17 12:20:59,988 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 12:20:59,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:59,989 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 12:20:59,990 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 12:21:00,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-17 12:21:00,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 39 statements. [2025-03-17 12:21:00,091 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 12:21:00,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:00,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 12:21:00,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:00,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:21:00,108 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:21:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:21:00,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:21:00,180 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-03-17 12:21:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2025-03-17 12:21:00,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:21:00,231 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 41 treesize of output 21 [2025-03-17 12:21:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:00,335 INFO L349 Elim1Store]: treesize reduction 110, result has 32.1 percent of original size [2025-03-17 12:21:00,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 69 [2025-03-17 12:21:00,414 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-17 12:21:00,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 48 [2025-03-17 12:21:00,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:21:00,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:00,767 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:21:00,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2025-03-17 12:21:00,900 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-17 12:21:00,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 45 [2025-03-17 12:21:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:21:01,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:21:01,721 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_length_~head#1.offset_92| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_129| Int) (v_ArrVal_1093 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_93| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_129| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_129|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_129| 1)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_93|))) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_1093) (not (= (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_93| 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_92| 0) (not (= 1 (select .cse0 .cse1))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_129|))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_129| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_129|) 0 v_ArrVal_1093)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_93|) |v_ULTIMATE.start_sll_length_~head#1.offset_92|) (= (select .cse0 (select (select .cse2 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_92|)) 1) (< v_ArrVal_1093 |v_ULTIMATE.start_sll_length_~head#1.offset_93|))))) is different from false [2025-03-17 12:21:01,735 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 126 treesize of output 118 [2025-03-17 12:21:02,900 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 238 treesize of output 234 [2025-03-17 12:21:02,992 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,995 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 434 treesize of output 426 [2025-03-17 12:21:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2025-03-17 12:21:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653417222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:21:10,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:21:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2025-03-17 12:21:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816481696] [2025-03-17 12:21:10,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:21:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 12:21:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:10,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 12:21:10,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2260, Unknown=2, NotChecked=96, Total=2550 [2025-03-17 12:21:10,033 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 51 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:12,527 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-03-17 12:21:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 12:21:12,527 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 12:21:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:12,528 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:21:12,528 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:21:12,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=370, Invalid=3792, Unknown=2, NotChecked=126, Total=4290 [2025-03-17 12:21:12,529 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:12,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 581 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1079 Invalid, 0 Unknown, 47 Unchecked, 1.4s Time] [2025-03-17 12:21:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:21:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-17 12:21:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2025-03-17 12:21:12,531 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 39 [2025-03-17 12:21:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2025-03-17 12:21:12,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2025-03-17 12:21:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:21:12,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:12,532 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 12:21:12,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 12:21:12,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:12,733 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:21:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1617204611, now seen corresponding path program 2 times [2025-03-17 12:21:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195557989] [2025-03-17 12:21:12,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:21:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:12,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 12:21:12,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:21:12,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:21:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:21:13,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195557989] [2025-03-17 12:21:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195557989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:21:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404083678] [2025-03-17 12:21:13,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:21:13,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:13,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:13,486 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 12:21:13,487 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 12:21:13,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 12:21:13,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:21:13,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:21:13,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:13,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-17 12:21:13,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:13,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:21:13,616 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 12:21:13,697 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:21:13,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:21:13,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:21:13,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:21:13,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:21:13,854 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:21:13,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-17 12:21:13,894 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-17 12:21:13,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-03-17 12:21:13,987 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 70 treesize of output 34 [2025-03-17 12:21:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:14,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:21:14,148 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-17 12:21:14,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-17 12:21:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:14,177 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-03-17 12:21:14,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-03-17 12:21:14,267 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-17 12:21:14,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 54 [2025-03-17 12:21:14,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:14,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-03-17 12:21:15,003 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:15,043 INFO L349 Elim1Store]: treesize reduction 73, result has 20.7 percent of original size [2025-03-17 12:21:15,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 76 [2025-03-17 12:21:15,061 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-03-17 12:21:15,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2025-03-17 12:21:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:21:15,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:21:21,434 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0)) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_100| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_99| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 v_ArrVal_1172)))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|))) (< (+ (select (select .cse0 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) 3) (select (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| v_ArrVal_1171) (select (select .cse2 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_99|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1172) (< v_ArrVal_1172 |v_ULTIMATE.start_sll_length_~head#1.offset_100|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_100| 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_99| 0) (< (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|) |v_ULTIMATE.start_sll_length_~head#1.offset_99|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0)) (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_100| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_99| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 v_ArrVal_1172)))) (or (< 0 (+ (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|)) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) 1)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1172) (< v_ArrVal_1172 |v_ULTIMATE.start_sll_length_~head#1.offset_100|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_100| 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_99| 0) (< (select (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|) |v_ULTIMATE.start_sll_length_~head#1.offset_99|))))))) is different from false [2025-03-17 12:21:21,504 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_100| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_99| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 v_ArrVal_1172)))) (or (< v_ArrVal_1172 |v_ULTIMATE.start_sll_length_~head#1.offset_100|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|))) (< (+ (select (select .cse0 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) 3) (select (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| v_ArrVal_1171) (select (select .cse2 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_99|))))) (< |v_ULTIMATE.start_sll_length_~head#1.offset_100| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_1172) (< (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_99| 0)))) (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_100| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_99| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 v_ArrVal_1172)))) (or (< v_ArrVal_1172 |v_ULTIMATE.start_sll_length_~head#1.offset_100|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0)) (< 0 (+ (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|)) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) 1)) (< |v_ULTIMATE.start_sll_length_~head#1.offset_100| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| v_ArrVal_1172) (< (select (select .cse3 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) (< |v_ULTIMATE.start_sll_length_~head#1.offset_99| 0))))) is different from false [2025-03-17 12:21:22,176 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) 0)) (forall ((v_ArrVal_1166 Int) (v_ArrVal_1168 Int)) (or (forall ((v_ArrVal_1172 Int) (v_ArrVal_1171 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_100| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_99| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| Int)) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) 0 v_ArrVal_1168)))) (store .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select .cse4 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 v_ArrVal_1172))))) (or (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select .cse3 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|))))) (let ((.cse1 (select (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|))) (< (+ (select (select .cse0 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) 3) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| v_ArrVal_1166) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| v_ArrVal_1171) (select (select .cse2 .cse1) |v_ULTIMATE.start_sll_length_~head#1.offset_99|))))) (< v_ArrVal_1172 |v_ULTIMATE.start_sll_length_~head#1.offset_100|) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| 1) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0)) (< (select (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) (< 0 v_ArrVal_1172) (< |v_ULTIMATE.start_sll_length_~head#1.offset_100| 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_99| 0)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1168))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| Int)) (or (forall ((v_ArrVal_1168 Int)) (or (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_100| Int) (|v_ULTIMATE.start_sll_length_~head#1.offset_99| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| Int)) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) 0 v_ArrVal_1168)))) (store .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select .cse7 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 v_ArrVal_1172))))) (or (< 0 (+ (select (select .cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (store .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138| (store (select .cse6 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|)) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) 1)) (< v_ArrVal_1172 |v_ULTIMATE.start_sll_length_~head#1.offset_100|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_138|) 0)) (< (select (select .cse5 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) |v_ULTIMATE.start_sll_length_~head#1.offset_100|) |v_ULTIMATE.start_sll_length_~head#1.offset_99|) (< 0 v_ArrVal_1172) (< |v_ULTIMATE.start_sll_length_~head#1.offset_100| 0) (< |v_ULTIMATE.start_sll_length_~head#1.offset_99| 0)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_1168))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_139|) 0))))) is different from false [2025-03-17 12:21:22,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:22,863 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:22,866 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 8793 treesize of output 8537 [2025-03-17 12:21:22,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:22,888 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:22,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:22,905 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 3160 treesize of output 3128 [2025-03-17 12:21:24,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:24,313 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 4709 treesize of output 4453 [2025-03-17 12:21:24,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 8 not checked. [2025-03-17 12:21:30,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404083678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:21:30,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:21:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 56 [2025-03-17 12:21:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834244946] [2025-03-17 12:21:30,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:21:30,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 12:21:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:30,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 12:21:30,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2722, Unknown=5, NotChecked=318, Total=3192 [2025-03-17 12:21:30,526 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 57 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:36,298 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2025-03-17 12:21:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 12:21:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 57 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 12:21:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:36,299 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:21:36,299 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:21:36,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=382, Invalid=4737, Unknown=5, NotChecked=426, Total=5550 [2025-03-17 12:21:36,300 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:36,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 882 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1391 Invalid, 0 Unknown, 136 Unchecked, 1.8s Time] [2025-03-17 12:21:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:21:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-17 12:21:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-03-17 12:21:36,302 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 39 [2025-03-17 12:21:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:36,302 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-03-17 12:21:36,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 57 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-03-17 12:21:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:21:36,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:36,303 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 12:21:36,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-17 12:21:36,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:36,504 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2025-03-17 12:21:36,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1494375417, now seen corresponding path program 5 times [2025-03-17 12:21:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:36,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542015231] [2025-03-17 12:21:36,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 12:21:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:36,511 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 5 equivalence classes. [2025-03-17 12:21:36,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:21:36,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 12:21:36,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:21:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542015231] [2025-03-17 12:21:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542015231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:21:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142691396] [2025-03-17 12:21:37,821 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 12:21:37,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:21:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:37,823 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 12:21:37,824 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 12:21:37,909 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 5 equivalence classes. [2025-03-17 12:21:37,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:21:37,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 12:21:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:37,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-03-17 12:21:37,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:21:37,959 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 12:21:37,965 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 12:21:38,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:21:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:21:38,137 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:21:38,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:21:38,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:21:38,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:21:38,219 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 20 treesize of output 15 [2025-03-17 12:21:38,360 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-17 12:21:38,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-03-17 12:21:38,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:21:38,493 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-17 12:21:38,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 54 [2025-03-17 12:21:38,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-17 12:21:38,687 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-17 12:21:38,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-17 12:21:38,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:21:38,718 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-03-17 12:21:38,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-03-17 12:21:38,858 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2025-03-17 12:21:38,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 143 treesize of output 67 [2025-03-17 12:21:38,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2025-03-17 12:21:40,311 INFO L349 Elim1Store]: treesize reduction 134, result has 12.4 percent of original size [2025-03-17 12:21:40,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 94 [2025-03-17 12:21:40,318 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:40,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 12:21:40,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 12:21:40,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:21:40,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:40,819 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 86 treesize of output 120