./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-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/array-memsafety/cstrpbrk-alloca-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 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:45:23,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:45:23,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:45:23,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:45:23,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:45:23,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:45:23,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:45:23,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:45:23,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:45:23,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:45:23,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:45:23,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:45:23,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:45:23,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:45:23,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:45:23,324 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:45:23,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:45:23,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:23,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:45:23,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:45:23,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:45:23,327 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 -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2025-03-17 11:45:23,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:45:23,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:45:23,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:45:23,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:45:23,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:45:23,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2025-03-17 11:45:24,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b8d3f58/b4501fb661d74808bb193e21f11dfca1/FLAGe9209df2a [2025-03-17 11:45:24,915 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:45:24,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2025-03-17 11:45:24,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b8d3f58/b4501fb661d74808bb193e21f11dfca1/FLAGe9209df2a [2025-03-17 11:45:24,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b8d3f58/b4501fb661d74808bb193e21f11dfca1 [2025-03-17 11:45:24,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:45:24,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:45:24,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:24,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:45:24,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:45:24,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:24" (1/1) ... [2025-03-17 11:45:24,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:24, skipping insertion in model container [2025-03-17 11:45:24,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:45:24" (1/1) ... [2025-03-17 11:45:24,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:45:25,200 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:45:25,201 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:45:25,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:25,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:45:25,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:45:25,253 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:45:25,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25 WrapperNode [2025-03-17 11:45:25,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:45:25,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:25,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:45:25,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:45:25,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,285 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2025-03-17 11:45:25,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:45:25,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:45:25,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:45:25,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:45:25,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,307 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-17 11:45:25,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:45:25,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:45:25,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:45:25,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:45:25,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (1/1) ... [2025-03-17 11:45:25,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:45:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:25,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:45:25,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:45:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:45:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:45:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:45:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:45:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:45:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:45:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:45:25,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:45:25,462 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:45:25,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:45:25,629 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-03-17 11:45:25,649 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-17 11:45:25,649 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:45:25,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:45:25,655 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:45:25,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:25 BoogieIcfgContainer [2025-03-17 11:45:25,655 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:45:25,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:45:25,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:45:25,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:45:25,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:45:24" (1/3) ... [2025-03-17 11:45:25,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0c11fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:25, skipping insertion in model container [2025-03-17 11:45:25,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:45:25" (2/3) ... [2025-03-17 11:45:25,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0c11fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:45:25, skipping insertion in model container [2025-03-17 11:45:25,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:45:25" (3/3) ... [2025-03-17 11:45:25,661 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2025-03-17 11:45:25,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:45:25,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrpbrk-alloca-2.i that has 1 procedures, 49 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-03-17 11:45:25,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:45:25,704 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;@53bbd55f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:45:25,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 11:45:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 2.0) internal successors, (58), 48 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 11:45:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:25,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:25,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:25,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1456926724, now seen corresponding path program 1 times [2025-03-17 11:45:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:25,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546943548] [2025-03-17 11:45:25,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:25,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:25,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:25,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:25,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546943548] [2025-03-17 11:45:25,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546943548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:25,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137737587] [2025-03-17 11:45:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:25,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:25,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:25,947 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 2.0) internal successors, (58), 48 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:25,995 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-03-17 11:45:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:45:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,002 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:45:26,003 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 11:45:26,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:26,006 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 108 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 11:45:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-03-17 11:45:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 49 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 11:45:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-03-17 11:45:26,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 6 [2025-03-17 11:45:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,026 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-17 11:45:26,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-03-17 11:45:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:26,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:45:26,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003203, now seen corresponding path program 1 times [2025-03-17 11:45:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799589457] [2025-03-17 11:45:26,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:26,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:26,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:26,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:26,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:26,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799589457] [2025-03-17 11:45:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799589457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:26,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574455343] [2025-03-17 11:45:26,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:26,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:26,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:26,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:26,149 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,187 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-03-17 11:45:26,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:45:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,189 INFO L225 Difference]: With dead ends: 48 [2025-03-17 11:45:26,189 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:45:26,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:26,190 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:45:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 11:45:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-17 11:45:26,196 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 6 [2025-03-17 11:45:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,197 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-17 11:45:26,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-17 11:45:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:45:26,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:45:26,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003202, now seen corresponding path program 1 times [2025-03-17 11:45:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398113536] [2025-03-17 11:45:26,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:45:26,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:45:26,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:26,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398113536] [2025-03-17 11:45:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398113536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:26,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069955635] [2025-03-17 11:45:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:26,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:26,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:26,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:26,420 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,499 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-03-17 11:45:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:26,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:45:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,500 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:45:26,500 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 11:45:26,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:26,501 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 108 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 11:45:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-03-17 11:45:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-17 11:45:26,507 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 6 [2025-03-17 11:45:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,507 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-17 11:45:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-17 11:45:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:26,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:45:26,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:26,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906776, now seen corresponding path program 1 times [2025-03-17 11:45:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-03-17 11:45:26,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-03-17 11:45:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001350071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:26,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:26,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-03-17 11:45:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:26,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:26,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:26,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:26,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:26,636 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,652 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-17 11:45:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:45:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,654 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:45:26,654 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:45:26,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:26,654 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 93 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:45:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-17 11:45:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-17 11:45:26,660 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 7 [2025-03-17 11:45:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-17 11:45:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-17 11:45:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:26,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:45:26,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906935, now seen corresponding path program 1 times [2025-03-17 11:45:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080262559] [2025-03-17 11:45:26,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:26,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:26,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:26,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080262559] [2025-03-17 11:45:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080262559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:26,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288398124] [2025-03-17 11:45:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:26,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:26,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:26,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:26,702 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,719 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-03-17 11:45:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:26,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:45:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,720 INFO L225 Difference]: With dead ends: 70 [2025-03-17 11:45:26,720 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 11:45:26,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:26,722 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 11:45:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-17 11:45:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-17 11:45:26,726 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 7 [2025-03-17 11:45:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-17 11:45:26,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-17 11:45:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:26,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:45:26,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:26,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830456, now seen corresponding path program 1 times [2025-03-17 11:45:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202532107] [2025-03-17 11:45:26,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:26,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:26,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:26,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202532107] [2025-03-17 11:45:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202532107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:26,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:26,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:26,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863996777] [2025-03-17 11:45:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:26,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:26,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:26,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:26,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:26,868 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:26,930 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-17 11:45:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:45:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:26,931 INFO L225 Difference]: With dead ends: 63 [2025-03-17 11:45:26,931 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 11:45:26,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:26,932 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:26,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 11:45:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-17 11:45:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2025-03-17 11:45:26,939 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 7 [2025-03-17 11:45:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-03-17 11:45:26,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2025-03-17 11:45:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:26,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:26,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:26,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:45:26,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830457, now seen corresponding path program 1 times [2025-03-17 11:45:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-03-17 11:45:26,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:26,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:26,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:26,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:27,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662088377] [2025-03-17 11:45:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662088377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:27,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:27,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:27,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103491172] [2025-03-17 11:45:27,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:27,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:27,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:27,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:27,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:27,058 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:27,131 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-03-17 11:45:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:27,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:45:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:27,131 INFO L225 Difference]: With dead ends: 68 [2025-03-17 11:45:27,131 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 11:45:27,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:27,132 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:27,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 93 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 11:45:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-17 11:45:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.607843137254902) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-17 11:45:27,136 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 7 [2025-03-17 11:45:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:27,136 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-17 11:45:27,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-17 11:45:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:45:27,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:27,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:27,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:45:27,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:27,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2108535927, now seen corresponding path program 1 times [2025-03-17 11:45:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133219019] [2025-03-17 11:45:27,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:27,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:45:27,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:45:27,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:27,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:27,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:27,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133219019] [2025-03-17 11:45:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133219019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:27,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547374359] [2025-03-17 11:45:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:27,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:27,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:27,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:27,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:27,230 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:27,282 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2025-03-17 11:45:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:45:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:27,284 INFO L225 Difference]: With dead ends: 76 [2025-03-17 11:45:27,284 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 11:45:27,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:27,284 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:27,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 11:45:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2025-03-17 11:45:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.607843137254902) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-17 11:45:27,287 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 7 [2025-03-17 11:45:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:27,287 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-17 11:45:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-17 11:45:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:45:27,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:27,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:45:27,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 52600599, now seen corresponding path program 1 times [2025-03-17 11:45:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-17 11:45:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:27,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:45:27,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:45:27,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:27,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:27,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:27,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-17 11:45:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161447603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:27,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:27,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629035835] [2025-03-17 11:45:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:27,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:27,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:27,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:27,376 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:27,392 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-03-17 11:45:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:45:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:27,393 INFO L225 Difference]: With dead ends: 71 [2025-03-17 11:45:27,393 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 11:45:27,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:27,394 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 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 11:45:27,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 11:45:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-17 11:45:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 68 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 11:45:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2025-03-17 11:45:27,400 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 8 [2025-03-17 11:45:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:27,400 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2025-03-17 11:45:27,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2025-03-17 11:45:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:45:27,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:27,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:27,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:45:27,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:27,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash 81229750, now seen corresponding path program 1 times [2025-03-17 11:45:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:27,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-17 11:45:27,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:27,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:27,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:45:27,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:45:27,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:27,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:27,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:27,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-17 11:45:27,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123554465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:27,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:27,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:27,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876434120] [2025-03-17 11:45:27,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:27,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:27,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:27,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:27,476 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:27,496 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-17 11:45:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 11:45:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:27,497 INFO L225 Difference]: With dead ends: 68 [2025-03-17 11:45:27,497 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 11:45:27,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:27,498 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:27,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 11:45:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-03-17 11:45:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.588235294117647) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-17 11:45:27,500 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 8 [2025-03-17 11:45:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:27,503 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-17 11:45:27,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-17 11:45:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:45:27,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:27,503 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:27,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:45:27,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:27,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -916672325, now seen corresponding path program 1 times [2025-03-17 11:45:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:27,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691812223] [2025-03-17 11:45:27,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:27,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:45:27,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:45:27,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:27,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691812223] [2025-03-17 11:45:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691812223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581018535] [2025-03-17 11:45:27,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:27,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:27,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:45:27,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:45:27,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:45:27,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:27,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:27,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:45:27,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:27,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:45:27,808 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 13 treesize of output 7 [2025-03-17 11:45:27,820 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 10 treesize of output 8 [2025-03-17 11:45:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:27,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:28,053 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:45:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581018535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:28,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-17 11:45:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911373916] [2025-03-17 11:45:28,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:28,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:45:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:45:28,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:45:28,063 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 11:45:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:28,191 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2025-03-17 11:45:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:45:28,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 9 [2025-03-17 11:45:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:28,192 INFO L225 Difference]: With dead ends: 68 [2025-03-17 11:45:28,192 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 11:45:28,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:45:28,193 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:28,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 11:45:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2025-03-17 11:45:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 61 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 11:45:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2025-03-17 11:45:28,195 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 9 [2025-03-17 11:45:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:28,195 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2025-03-17 11:45:28,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 11:45:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2025-03-17 11:45:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:28,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:28,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:28,400 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,SelfDestructingSolverStorable10 [2025-03-17 11:45:28,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash -990432494, now seen corresponding path program 1 times [2025-03-17 11:45:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925952181] [2025-03-17 11:45:28,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:28,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:28,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:28,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:28,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925952181] [2025-03-17 11:45:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925952181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:28,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366622602] [2025-03-17 11:45:28,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:28,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:28,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:28,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:28,435 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:28,470 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-03-17 11:45:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-17 11:45:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:28,471 INFO L225 Difference]: With dead ends: 61 [2025-03-17 11:45:28,471 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 11:45:28,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:28,472 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:28,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 55 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 11:45:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-17 11:45:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.530612244897959) internal successors, (75), 59 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-17 11:45:28,475 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 10 [2025-03-17 11:45:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:28,475 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-17 11:45:28,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-17 11:45:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:28,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:28,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:28,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:45:28,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:28,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -990432493, now seen corresponding path program 1 times [2025-03-17 11:45:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:28,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-17 11:45:28,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:28,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:28,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:28,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:28,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-17 11:45:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658374046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:28,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:28,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:45:28,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694015144] [2025-03-17 11:45:28,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:45:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:28,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:45:28,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:28,567 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:28,631 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2025-03-17 11:45:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:45:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-17 11:45:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:28,632 INFO L225 Difference]: With dead ends: 83 [2025-03-17 11:45:28,632 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 11:45:28,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:28,633 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:28,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 98 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 11:45:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2025-03-17 11:45:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 62 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2025-03-17 11:45:28,635 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 10 [2025-03-17 11:45:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:28,635 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2025-03-17 11:45:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2025-03-17 11:45:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:28,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:28,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:45:28,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:28,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 757151514, now seen corresponding path program 1 times [2025-03-17 11:45:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861771226] [2025-03-17 11:45:28,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:28,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:28,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:28,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:28,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:28,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861771226] [2025-03-17 11:45:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861771226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734357454] [2025-03-17 11:45:28,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:28,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:28,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:28,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:28,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:45:28,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:28,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:28,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:28,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:28,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:45:28,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:28,837 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 7 [2025-03-17 11:45:28,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 11:45:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:28,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734357454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:29,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-17 11:45:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631968814] [2025-03-17 11:45:29,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:29,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:45:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:29,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:45:29,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:45:29,099 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:29,264 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2025-03-17 11:45:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:29,265 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 10 [2025-03-17 11:45:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:29,265 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:45:29,265 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:45:29,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:45:29,266 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:29,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:45:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-03-17 11:45:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 57 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-03-17 11:45:29,268 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 10 [2025-03-17 11:45:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:29,268 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-03-17 11:45:29,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-03-17 11:45:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:45:29,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:29,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:29,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:29,475 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,SelfDestructingSolverStorable13 [2025-03-17 11:45:29,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:29,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1647923930, now seen corresponding path program 1 times [2025-03-17 11:45:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:29,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744560700] [2025-03-17 11:45:29,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:45:29,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:45:29,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:29,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:29,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744560700] [2025-03-17 11:45:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744560700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:45:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560826882] [2025-03-17 11:45:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:29,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:29,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:29,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:29,599 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:29,632 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2025-03-17 11:45:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:45:29,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-17 11:45:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:29,632 INFO L225 Difference]: With dead ends: 57 [2025-03-17 11:45:29,633 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 11:45:29,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:29,633 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:29,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 87 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 11:45:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-03-17 11:45:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-17 11:45:29,635 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 10 [2025-03-17 11:45:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:29,635 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-17 11:45:29,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-17 11:45:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:45:29,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:29,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:45:29,635 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1092990704, now seen corresponding path program 1 times [2025-03-17 11:45:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83286279] [2025-03-17 11:45:29,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:29,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:29,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:29,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:29,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83286279] [2025-03-17 11:45:29,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83286279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:29,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:45:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580945885] [2025-03-17 11:45:29,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:29,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:45:29,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:29,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:45:29,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:29,736 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 11:45:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:29,759 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-17 11:45:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:45:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 14 [2025-03-17 11:45:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:29,760 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:45:29,760 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:45:29,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:45:29,760 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:29,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:45:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 11:45:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-17 11:45:29,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 14 [2025-03-17 11:45:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:29,762 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-17 11:45:29,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 11:45:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-03-17 11:45:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:45:29,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:29,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:29,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:45:29,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:29,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1093045352, now seen corresponding path program 1 times [2025-03-17 11:45:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461591546] [2025-03-17 11:45:29,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:29,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:29,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:29,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:29,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461591546] [2025-03-17 11:45:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461591546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:29,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:45:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138250168] [2025-03-17 11:45:29,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:29,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:45:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:29,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:45:29,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:45:29,807 INFO L87 Difference]: Start difference. First operand 46 states and 54 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 11:45:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:29,838 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-17 11:45:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:45:29,839 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 14 [2025-03-17 11:45:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:29,839 INFO L225 Difference]: With dead ends: 43 [2025-03-17 11:45:29,839 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 11:45:29,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:45:29,840 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:29,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 11:45:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 11:45:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 42 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 11:45:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-17 11:45:29,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 14 [2025-03-17 11:45:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:29,841 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-17 11:45:29,841 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 11:45:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-17 11:45:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:45:29,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:29,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:45:29,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1093045353, now seen corresponding path program 1 times [2025-03-17 11:45:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-03-17 11:45:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:45:29,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:45:29,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:29,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27763768] [2025-03-17 11:45:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27763768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:45:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578679955] [2025-03-17 11:45:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:29,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:29,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:29,942 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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 11:45:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:30,014 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-17 11:45:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:45:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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 14 [2025-03-17 11:45:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:30,014 INFO L225 Difference]: With dead ends: 54 [2025-03-17 11:45:30,014 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 11:45:30,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:30,015 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:30,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 65 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 11:45:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-17 11:45:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-17 11:45:30,018 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2025-03-17 11:45:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:30,018 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-17 11:45:30,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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 11:45:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-17 11:45:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:45:30,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:30,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:30,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:45:30,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:30,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash -122176880, now seen corresponding path program 1 times [2025-03-17 11:45:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:30,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077041539] [2025-03-17 11:45:30,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:30,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:30,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:45:30,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:45:30,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:30,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077041539] [2025-03-17 11:45:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077041539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:45:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022862739] [2025-03-17 11:45:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:45:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:45:30,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:30,043 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 11:45:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:30,049 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-03-17 11:45:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:45:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 11:45:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:30,050 INFO L225 Difference]: With dead ends: 52 [2025-03-17 11:45:30,050 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 11:45:30,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:45:30,051 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:30,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 11:45:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 11:45:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-17 11:45:30,054 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 18 [2025-03-17 11:45:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:30,054 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-17 11:45:30,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 11:45:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-17 11:45:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:45:30,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:30,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:45:30,055 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1448736690, now seen corresponding path program 1 times [2025-03-17 11:45:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:30,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403833643] [2025-03-17 11:45:30,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:30,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:30,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:45:30,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:45:30,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:30,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403833643] [2025-03-17 11:45:30,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403833643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:30,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:30,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:45:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132867255] [2025-03-17 11:45:30,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:45:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:45:30,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:45:30,190 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:30,221 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-03-17 11:45:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:45:30,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-17 11:45:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:30,222 INFO L225 Difference]: With dead ends: 61 [2025-03-17 11:45:30,222 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:45:30,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:30,222 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:30,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:45:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 11:45:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-17 11:45:30,224 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 20 [2025-03-17 11:45:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:30,224 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-17 11:45:30,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-17 11:45:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:45:30,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:30,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:30,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:45:30,225 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2001758735, now seen corresponding path program 1 times [2025-03-17 11:45:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299288930] [2025-03-17 11:45:30,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:45:30,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:45:30,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:30,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:30,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299288930] [2025-03-17 11:45:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299288930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:30,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:30,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:45:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613126615] [2025-03-17 11:45:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:45:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:45:30,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:45:30,345 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:30,379 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-17 11:45:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:45:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-17 11:45:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:30,380 INFO L225 Difference]: With dead ends: 62 [2025-03-17 11:45:30,380 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 11:45:30,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:30,380 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 126 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 11:45:30,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 126 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 11:45:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-03-17 11:45:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-17 11:45:30,382 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 20 [2025-03-17 11:45:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:30,382 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-17 11:45:30,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-17 11:45:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:30,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:30,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:30,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:45:30,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:30,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash -941980532, now seen corresponding path program 1 times [2025-03-17 11:45:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:30,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-03-17 11:45:30,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:30,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:30,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:30,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:30,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-03-17 11:45:30,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304235757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:30,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:45:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382622376] [2025-03-17 11:45:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:45:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:45:30,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:45:30,530 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:30,600 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-03-17 11:45:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:30,603 INFO L225 Difference]: With dead ends: 67 [2025-03-17 11:45:30,603 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 11:45:30,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:45:30,604 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:30,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 180 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 11:45:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-03-17 11:45:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.25) internal successors, (75), 64 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-17 11:45:30,608 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2025-03-17 11:45:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:30,608 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-17 11:45:30,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-17 11:45:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:30,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:30,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:45:30,609 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -941153316, now seen corresponding path program 1 times [2025-03-17 11:45:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-17 11:45:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:30,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:30,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:30,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:30,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-17 11:45:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333806463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:45:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931406440] [2025-03-17 11:45:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:45:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:45:30,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:45:30,701 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:30,787 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-03-17 11:45:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:30,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:30,789 INFO L225 Difference]: With dead ends: 65 [2025-03-17 11:45:30,789 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 11:45:30,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:45:30,789 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:30,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 134 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 11:45:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 11:45:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-17 11:45:30,791 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2025-03-17 11:45:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:30,791 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-17 11:45:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-17 11:45:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:45:30,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:30,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:30,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:45:30,793 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:30,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -730629619, now seen corresponding path program 1 times [2025-03-17 11:45:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-03-17 11:45:30,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:30,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:45:30,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:45:30,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:30,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-03-17 11:45:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442142527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:45:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:45:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 11:45:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209315122] [2025-03-17 11:45:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:45:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:45:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:30,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:45:30,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:45:30,967 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:31,034 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-17 11:45:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:31,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 11:45:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:31,035 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:45:31,035 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 11:45:31,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:45:31,036 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:31,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 150 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:45:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 11:45:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-17 11:45:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-17 11:45:31,037 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 23 [2025-03-17 11:45:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:31,037 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-17 11:45:31,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-17 11:45:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:45:31,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:31,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:31,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:45:31,037 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:31,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash -303541940, now seen corresponding path program 1 times [2025-03-17 11:45:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:31,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-03-17 11:45:31,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:31,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:45:31,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:45:31,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:31,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:31,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:31,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-03-17 11:45:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285262661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430551352] [2025-03-17 11:45:31,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:31,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:31,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:31,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:31,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:45:31,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:45:31,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:45:31,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:31,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:31,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 11:45:31,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:31,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:31,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:45:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430551352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:31,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-03-17 11:45:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663531498] [2025-03-17 11:45:31,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:45:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:31,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:45:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:45:31,502 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 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 11:45:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:31,657 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-03-17 11:45:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:45:31,658 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 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) Word has length 26 [2025-03-17 11:45:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:31,658 INFO L225 Difference]: With dead ends: 53 [2025-03-17 11:45:31,658 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:45:31,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:45:31,659 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:31,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 151 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:45:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2025-03-17 11:45:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 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 11:45:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-17 11:45:31,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2025-03-17 11:45:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:31,660 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-17 11:45:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 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 11:45:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-17 11:45:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:45:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:31,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:31,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:31,865 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 353927002, now seen corresponding path program 1 times [2025-03-17 11:45:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-03-17 11:45:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:31,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:45:31,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:45:31,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:31,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-03-17 11:45:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723639110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:32,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168016960] [2025-03-17 11:45:32,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:32,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:32,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:32,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:32,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:45:32,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:45:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:45:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:32,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:45:32,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:32,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:32,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:45:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:32,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168016960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:32,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:32,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-17 11:45:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156171832] [2025-03-17 11:45:32,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:32,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:45:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:32,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:45:32,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:45:32,286 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:32,375 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-03-17 11:45:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:45:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 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 11:45:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:32,375 INFO L225 Difference]: With dead ends: 78 [2025-03-17 11:45:32,375 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 11:45:32,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:45:32,376 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:32,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 140 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 11:45:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2025-03-17 11:45:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 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 11:45:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-03-17 11:45:32,377 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 28 [2025-03-17 11:45:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:32,378 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-03-17 11:45:32,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-03-17 11:45:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:45:32,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:32,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:32,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:32,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 11:45:32,584 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash 791369457, now seen corresponding path program 2 times [2025-03-17 11:45:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737949044] [2025-03-17 11:45:32,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:32,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 11:45:32,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:45:32,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:32,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737949044] [2025-03-17 11:45:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737949044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328730285] [2025-03-17 11:45:32,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:32,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:32,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:32,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:32,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:45:32,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-17 11:45:32,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:45:32,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:32,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:32,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 11:45:32,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:32,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:45:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:33,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:33,058 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 13 [2025-03-17 11:45:33,060 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 16 treesize of output 12 [2025-03-17 11:45:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328730285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:33,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 26 [2025-03-17 11:45:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711101529] [2025-03-17 11:45:33,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 11:45:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:33,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 11:45:33,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:45:33,102 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:33,290 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2025-03-17 11:45:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:45:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 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 32 [2025-03-17 11:45:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:33,291 INFO L225 Difference]: With dead ends: 96 [2025-03-17 11:45:33,291 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 11:45:33,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:45:33,291 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:33,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 235 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 11:45:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2025-03-17 11:45:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2025-03-17 11:45:33,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 32 [2025-03-17 11:45:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:33,293 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2025-03-17 11:45:33,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2025-03-17 11:45:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:45:33,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:33,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:33,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:33,498 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,SelfDestructingSolverStorable26 [2025-03-17 11:45:33,498 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:33,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1145779858, now seen corresponding path program 3 times [2025-03-17 11:45:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54815909] [2025-03-17 11:45:33,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:33,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-17 11:45:33,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:45:33,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:45:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:33,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:33,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54815909] [2025-03-17 11:45:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54815909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:33,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587925555] [2025-03-17 11:45:33,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:33,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:33,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:45:33,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-17 11:45:33,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:45:33,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:45:33,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:33,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:45:33,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:33,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:34,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:45:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587925555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:34,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-03-17 11:45:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83327381] [2025-03-17 11:45:34,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:34,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:45:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:34,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:45:34,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:45:34,060 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:34,240 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2025-03-17 11:45:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:45:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 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 11:45:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:34,241 INFO L225 Difference]: With dead ends: 116 [2025-03-17 11:45:34,241 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 11:45:34,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:45:34,241 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 147 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:34,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 213 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 11:45:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2025-03-17 11:45:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.134020618556701) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-03-17 11:45:34,244 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 35 [2025-03-17 11:45:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:34,244 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-03-17 11:45:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-03-17 11:45:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:45:34,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:34,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:34,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:34,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 11:45:34,445 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:34,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash 187340707, now seen corresponding path program 2 times [2025-03-17 11:45:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:34,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-17 11:45:34,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:34,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 11:45:34,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:45:34,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-17 11:45:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645408295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824550363] [2025-03-17 11:45:34,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:34,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:34,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:34,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:45:34,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 11:45:34,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:45:34,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:34,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:34,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-17 11:45:34,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:34,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:45:34,875 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 8 treesize of output 1 [2025-03-17 11:45:35,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:35,094 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 31 treesize of output 15 [2025-03-17 11:45:35,144 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 16 treesize of output 8 [2025-03-17 11:45:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:35,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:35,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-17 11:45:35,540 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 40 treesize of output 34 [2025-03-17 11:45:35,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:35,545 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 67 treesize of output 53 [2025-03-17 11:45:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824550363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:35,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 19] total 43 [2025-03-17 11:45:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808085399] [2025-03-17 11:45:35,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:35,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 11:45:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:35,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 11:45:35,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1640, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:45:35,688 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 43 states, 43 states have (on average 2.604651162790698) internal successors, (112), 43 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 11:45:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:36,082 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2025-03-17 11:45:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:45:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.604651162790698) internal successors, (112), 43 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) Word has length 40 [2025-03-17 11:45:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:36,083 INFO L225 Difference]: With dead ends: 163 [2025-03-17 11:45:36,083 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 11:45:36,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=2409, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 11:45:36,084 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:36,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 280 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 11:45:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-17 11:45:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-03-17 11:45:36,087 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 40 [2025-03-17 11:45:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:36,087 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-03-17 11:45:36,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.604651162790698) internal successors, (112), 43 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 11:45:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-03-17 11:45:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 11:45:36,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:36,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:36,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:36,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:36,290 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash 503492535, now seen corresponding path program 4 times [2025-03-17 11:45:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-17 11:45:36,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:36,301 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-17 11:45:36,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 41 statements. [2025-03-17 11:45:36,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:36,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:36,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-17 11:45:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861974994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282428003] [2025-03-17 11:45:36,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:36,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:36,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:45:36,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-17 11:45:36,783 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 41 statements. [2025-03-17 11:45:36,783 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:36,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 11:45:36,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:36,863 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 14 treesize of output 10 [2025-03-17 11:45:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:37,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:37,200 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 44 treesize of output 38 [2025-03-17 11:45:37,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:37,204 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 44 treesize of output 34 [2025-03-17 11:45:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282428003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:37,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-03-17 11:45:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858025] [2025-03-17 11:45:37,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:37,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:45:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:37,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:45:37,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:45:37,329 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:37,785 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2025-03-17 11:45:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:45:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-17 11:45:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:37,786 INFO L225 Difference]: With dead ends: 216 [2025-03-17 11:45:37,786 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 11:45:37,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 11:45:37,787 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:37,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 354 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 11:45:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2025-03-17 11:45:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 1.111731843575419) internal successors, (199), 180 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2025-03-17 11:45:37,790 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 41 [2025-03-17 11:45:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2025-03-17 11:45:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2025-03-17 11:45:37,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:45:37,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:37,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:37,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 11:45:37,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:37,994 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:37,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1918820350, now seen corresponding path program 3 times [2025-03-17 11:45:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:37,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-17 11:45:37,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:38,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-03-17 11:45:38,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:45:38,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:45:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-17 11:45:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942239671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848976432] [2025-03-17 11:45:38,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:38,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:38,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:45:38,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-03-17 11:45:38,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:45:38,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:45:38,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:38,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 11:45:38,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:38,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:38,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:45:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848976432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:38,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 11:45:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515606297] [2025-03-17 11:45:38,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:38,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:45:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:38,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:45:38,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:45:38,484 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand has 20 states, 19 states have (on average 5.157894736842105) internal successors, (98), 20 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 11:45:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:38,625 INFO L93 Difference]: Finished difference Result 291 states and 316 transitions. [2025-03-17 11:45:38,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:45:38,625 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.157894736842105) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:45:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:38,626 INFO L225 Difference]: With dead ends: 291 [2025-03-17 11:45:38,626 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 11:45:38,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:45:38,627 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:38,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 242 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:45:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 11:45:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 236. [2025-03-17 11:45:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 234 states have (on average 1.106837606837607) internal successors, (259), 235 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 259 transitions. [2025-03-17 11:45:38,631 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 259 transitions. Word has length 43 [2025-03-17 11:45:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:38,631 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 259 transitions. [2025-03-17 11:45:38,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.157894736842105) internal successors, (98), 20 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 11:45:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 259 transitions. [2025-03-17 11:45:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 11:45:38,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:38,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:38,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 11:45:38,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:38,832 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:38,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash -142748362, now seen corresponding path program 5 times [2025-03-17 11:45:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-17 11:45:38,832 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:38,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 4 equivalence classes. [2025-03-17 11:45:38,843 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:45:38,843 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 11:45:38,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-17 11:45:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662570937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126878434] [2025-03-17 11:45:39,022 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:39,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:39,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:39,024 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:39,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:45:39,081 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 4 equivalence classes. [2025-03-17 11:45:39,105 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:45:39,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 11:45:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:39,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:45:39,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:39,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:45:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:39,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126878434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:39,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-17 11:45:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133951632] [2025-03-17 11:45:39,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:45:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:39,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:45:39,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:45:39,538 INFO L87 Difference]: Start difference. First operand 236 states and 259 transitions. Second operand has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:39,834 INFO L93 Difference]: Finished difference Result 293 states and 321 transitions. [2025-03-17 11:45:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:45:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-17 11:45:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:39,835 INFO L225 Difference]: With dead ends: 293 [2025-03-17 11:45:39,835 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 11:45:39,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 11:45:39,836 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:39,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 440 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 11:45:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 260. [2025-03-17 11:45:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 258 states have (on average 1.1085271317829457) internal successors, (286), 259 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2025-03-17 11:45:39,842 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 44 [2025-03-17 11:45:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:39,842 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2025-03-17 11:45:39,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 32 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2025-03-17 11:45:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:45:39,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:39,843 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:39,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 11:45:40,043 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,SelfDestructingSolverStorable31 [2025-03-17 11:45:40,043 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash 532988763, now seen corresponding path program 6 times [2025-03-17 11:45:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-17 11:45:40,044 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:40,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 5 equivalence classes. [2025-03-17 11:45:40,069 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:45:40,070 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:45:40,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:40,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-17 11:45:40,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644482469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448558567] [2025-03-17 11:45:40,350 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:40,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:40,351 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:40,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:45:40,409 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 5 equivalence classes. [2025-03-17 11:45:40,487 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:45:40,487 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 11:45:40,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:40,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 11:45:40,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:40,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:45:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:40,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:40,719 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 13 [2025-03-17 11:45:40,724 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 16 treesize of output 12 [2025-03-17 11:45:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448558567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:40,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 31 [2025-03-17 11:45:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774395] [2025-03-17 11:45:40,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:40,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:45:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:40,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:45:40,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:45:40,768 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:41,071 INFO L93 Difference]: Finished difference Result 390 states and 423 transitions. [2025-03-17 11:45:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:45:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-17 11:45:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:41,072 INFO L225 Difference]: With dead ends: 390 [2025-03-17 11:45:41,072 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 11:45:41,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 11:45:41,073 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:41,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 698 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 11:45:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 342. [2025-03-17 11:45:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 340 states have (on average 1.1058823529411765) internal successors, (376), 341 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 376 transitions. [2025-03-17 11:45:41,082 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 376 transitions. Word has length 50 [2025-03-17 11:45:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 376 transitions. [2025-03-17 11:45:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 376 transitions. [2025-03-17 11:45:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 11:45:41,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:41,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:41,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:41,283 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,SelfDestructingSolverStorable32 [2025-03-17 11:45:41,283 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1905107780, now seen corresponding path program 7 times [2025-03-17 11:45:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839801308] [2025-03-17 11:45:41,284 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:45:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:41,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:45:41,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:45:41,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:41,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839801308] [2025-03-17 11:45:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839801308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126502390] [2025-03-17 11:45:41,582 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:45:41,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:41,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:41,583 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:41,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 11:45:41,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:45:41,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:45:41,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:41,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:41,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 11:45:41,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:41,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:41,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:45:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126502390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:42,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:42,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-03-17 11:45:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137768564] [2025-03-17 11:45:42,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:42,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:45:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:42,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:45:42,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:45:42,059 INFO L87 Difference]: Start difference. First operand 342 states and 376 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:42,327 INFO L93 Difference]: Finished difference Result 402 states and 441 transitions. [2025-03-17 11:45:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:45:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 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 53 [2025-03-17 11:45:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:42,328 INFO L225 Difference]: With dead ends: 402 [2025-03-17 11:45:42,328 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 11:45:42,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 11:45:42,329 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:42,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 398 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 11:45:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 366. [2025-03-17 11:45:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 364 states have (on average 1.1071428571428572) internal successors, (403), 365 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 403 transitions. [2025-03-17 11:45:42,335 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 403 transitions. Word has length 53 [2025-03-17 11:45:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:42,335 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 403 transitions. [2025-03-17 11:45:42,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 403 transitions. [2025-03-17 11:45:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 11:45:42,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:42,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:42,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 11:45:42,536 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,SelfDestructingSolverStorable33 [2025-03-17 11:45:42,536 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:42,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1639939147, now seen corresponding path program 4 times [2025-03-17 11:45:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039528367] [2025-03-17 11:45:42,537 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:42,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-17 11:45:42,558 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 55 statements. [2025-03-17 11:45:42,558 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:42,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:42,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039528367] [2025-03-17 11:45:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039528367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163113358] [2025-03-17 11:45:42,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:42,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:42,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:42,958 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:42,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 11:45:43,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-17 11:45:43,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 55 statements. [2025-03-17 11:45:43,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:43,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-17 11:45:43,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:43,055 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 14 treesize of output 10 [2025-03-17 11:45:43,080 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 21 treesize of output 1 [2025-03-17 11:45:44,048 INFO L349 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2025-03-17 11:45:44,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 62 treesize of output 54 [2025-03-17 11:45:44,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:44,268 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 37 treesize of output 33 [2025-03-17 11:45:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:44,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:45,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:45,398 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 79 treesize of output 81 [2025-03-17 11:45:45,407 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 65 treesize of output 61 [2025-03-17 11:45:45,426 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 149 treesize of output 143 [2025-03-17 11:45:45,532 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 57 treesize of output 49 [2025-03-17 11:45:45,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 126 treesize of output 104 [2025-03-17 11:45:45,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:45:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:45:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163113358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:45,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 23] total 52 [2025-03-17 11:45:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763566007] [2025-03-17 11:45:45,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:45,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 11:45:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:45,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 11:45:45,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2425, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 11:45:45,554 INFO L87 Difference]: Start difference. First operand 366 states and 403 transitions. Second operand has 53 states, 52 states have (on average 2.519230769230769) internal successors, (131), 53 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:48,299 INFO L93 Difference]: Finished difference Result 1040 states and 1138 transitions. [2025-03-17 11:45:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-17 11:45:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.519230769230769) internal successors, (131), 53 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-17 11:45:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:48,302 INFO L225 Difference]: With dead ends: 1040 [2025-03-17 11:45:48,302 INFO L226 Difference]: Without dead ends: 989 [2025-03-17 11:45:48,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1379, Invalid=6103, Unknown=0, NotChecked=0, Total=7482 [2025-03-17 11:45:48,305 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 217 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:48,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 607 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:45:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-17 11:45:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 411. [2025-03-17 11:45:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 409 states have (on average 1.1124694376528117) internal successors, (455), 410 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 455 transitions. [2025-03-17 11:45:48,314 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 455 transitions. Word has length 55 [2025-03-17 11:45:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:48,314 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 455 transitions. [2025-03-17 11:45:48,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.519230769230769) internal successors, (131), 53 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 455 transitions. [2025-03-17 11:45:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 11:45:48,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:48,317 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:48,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 11:45:48,517 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,SelfDestructingSolverStorable34 [2025-03-17 11:45:48,517 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash -914682271, now seen corresponding path program 8 times [2025-03-17 11:45:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:48,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635420595] [2025-03-17 11:45:48,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:48,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-17 11:45:48,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:45:48,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:48,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635420595] [2025-03-17 11:45:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635420595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994644988] [2025-03-17 11:45:48,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:45:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:48,840 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:48,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 11:45:48,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-17 11:45:48,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:45:48,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:45:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:48,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 11:45:48,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:49,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:45:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:49,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:49,120 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 13 [2025-03-17 11:45:49,121 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 16 treesize of output 12 [2025-03-17 11:45:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994644988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:49,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-03-17 11:45:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410652592] [2025-03-17 11:45:49,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:49,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 11:45:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:49,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 11:45:49,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:45:49,162 INFO L87 Difference]: Start difference. First operand 411 states and 455 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:49,532 INFO L93 Difference]: Finished difference Result 605 states and 662 transitions. [2025-03-17 11:45:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:45:49,532 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-17 11:45:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:49,533 INFO L225 Difference]: With dead ends: 605 [2025-03-17 11:45:49,533 INFO L226 Difference]: Without dead ends: 559 [2025-03-17 11:45:49,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:45:49,534 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 104 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:49,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 814 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-17 11:45:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 543. [2025-03-17 11:45:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 541 states have (on average 1.11090573012939) internal successors, (601), 542 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 601 transitions. [2025-03-17 11:45:49,542 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 601 transitions. Word has length 59 [2025-03-17 11:45:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 601 transitions. [2025-03-17 11:45:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 601 transitions. [2025-03-17 11:45:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 11:45:49,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:49,543 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:49,549 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 11:45:49,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:49,747 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:49,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 31289888, now seen corresponding path program 9 times [2025-03-17 11:45:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265508030] [2025-03-17 11:45:49,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:49,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 6 equivalence classes. [2025-03-17 11:45:49,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:45:49,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:45:49,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:50,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:50,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265508030] [2025-03-17 11:45:50,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265508030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:50,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031932003] [2025-03-17 11:45:50,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:45:50,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:50,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:50,059 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:50,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 11:45:50,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 6 equivalence classes. [2025-03-17 11:45:50,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:45:50,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:45:50,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:50,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:45:50,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:50,166 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 13 treesize of output 1 [2025-03-17 11:45:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:50,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031932003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:50,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2025-03-17 11:45:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90156080] [2025-03-17 11:45:50,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 11:45:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:50,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 11:45:50,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:45:50,578 INFO L87 Difference]: Start difference. First operand 543 states and 601 transitions. Second operand has 42 states, 41 states have (on average 3.682926829268293) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:50,890 INFO L93 Difference]: Finished difference Result 622 states and 687 transitions. [2025-03-17 11:45:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:45:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.682926829268293) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-17 11:45:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:50,892 INFO L225 Difference]: With dead ends: 622 [2025-03-17 11:45:50,892 INFO L226 Difference]: Without dead ends: 622 [2025-03-17 11:45:50,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=2103, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 11:45:50,893 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 130 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:50,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 281 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-17 11:45:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 573. [2025-03-17 11:45:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 571 states have (on average 1.1120840630472855) internal successors, (635), 572 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 635 transitions. [2025-03-17 11:45:50,899 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 635 transitions. Word has length 62 [2025-03-17 11:45:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:50,900 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 635 transitions. [2025-03-17 11:45:50,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.682926829268293) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 635 transitions. [2025-03-17 11:45:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 11:45:50,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:50,900 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:50,908 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 11:45:51,101 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,SelfDestructingSolverStorable36 [2025-03-17 11:45:51,101 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1299286213, now seen corresponding path program 10 times [2025-03-17 11:45:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106920700] [2025-03-17 11:45:51,102 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:51,110 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-17 11:45:51,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 68 statements. [2025-03-17 11:45:51,117 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:51,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 96 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106920700] [2025-03-17 11:45:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106920700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788956700] [2025-03-17 11:45:52,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:45:52,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:52,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:52,121 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:52,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 11:45:52,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-03-17 11:45:52,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 68 statements. [2025-03-17 11:45:52,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:45:52,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:52,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-17 11:45:52,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:52,430 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 14 treesize of output 10 [2025-03-17 11:45:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 86 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:53,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:53,655 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 89 treesize of output 77 [2025-03-17 11:45:53,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:45:53,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 67 [2025-03-17 11:45:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 96 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788956700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:54,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 67 [2025-03-17 11:45:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444872044] [2025-03-17 11:45:54,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-17 11:45:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:54,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-17 11:45:54,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=3859, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 11:45:54,070 INFO L87 Difference]: Start difference. First operand 573 states and 635 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 67 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:55,082 INFO L93 Difference]: Finished difference Result 822 states and 901 transitions. [2025-03-17 11:45:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 11:45:55,083 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 67 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 11:45:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:55,084 INFO L225 Difference]: With dead ends: 822 [2025-03-17 11:45:55,084 INFO L226 Difference]: Without dead ends: 770 [2025-03-17 11:45:55,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1036, Invalid=7154, Unknown=0, NotChecked=0, Total=8190 [2025-03-17 11:45:55,086 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:55,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 432 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:45:55,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-17 11:45:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 729. [2025-03-17 11:45:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 727 states have (on average 1.1127922971114168) internal successors, (809), 728 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 809 transitions. [2025-03-17 11:45:55,094 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 809 transitions. Word has length 68 [2025-03-17 11:45:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:55,094 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 809 transitions. [2025-03-17 11:45:55,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 67 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 809 transitions. [2025-03-17 11:45:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 11:45:55,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:55,095 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:55,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 11:45:55,299 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,SelfDestructingSolverStorable37 [2025-03-17 11:45:55,299 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash 215608294, now seen corresponding path program 11 times [2025-03-17 11:45:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:55,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503051614] [2025-03-17 11:45:55,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:55,307 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 71 statements into 7 equivalence classes. [2025-03-17 11:45:55,316 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:45:55,316 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 11:45:55,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503051614] [2025-03-17 11:45:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503051614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117467670] [2025-03-17 11:45:55,624 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:45:55,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:55,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:55,626 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:55,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 11:45:55,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 71 statements into 7 equivalence classes. [2025-03-17 11:45:55,737 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:45:55,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-17 11:45:55,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:55,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-17 11:45:55,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:55,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:45:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:55,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:45:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117467670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:56,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2025-03-17 11:45:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945476030] [2025-03-17 11:45:56,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:56,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 11:45:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:56,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 11:45:56,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 11:45:56,498 INFO L87 Difference]: Start difference. First operand 729 states and 809 transitions. Second operand has 46 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 46 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:56,986 INFO L93 Difference]: Finished difference Result 812 states and 899 transitions. [2025-03-17 11:45:56,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:45:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 46 states have internal predecessors, (174), 0 states have call successors, (0), 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 71 [2025-03-17 11:45:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:56,988 INFO L225 Difference]: With dead ends: 812 [2025-03-17 11:45:56,988 INFO L226 Difference]: Without dead ends: 812 [2025-03-17 11:45:56,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=2615, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 11:45:56,988 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 114 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:56,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 851 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:45:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-17 11:45:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 759. [2025-03-17 11:45:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 757 states have (on average 1.1136063408190224) internal successors, (843), 758 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 843 transitions. [2025-03-17 11:45:56,996 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 843 transitions. Word has length 71 [2025-03-17 11:45:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:56,996 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 843 transitions. [2025-03-17 11:45:56,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.8666666666666667) internal successors, (174), 46 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 843 transitions. [2025-03-17 11:45:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 11:45:56,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:56,997 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:57,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 11:45:57,198 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,SelfDestructingSolverStorable38 [2025-03-17 11:45:57,198 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:57,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1591515132, now seen corresponding path program 1 times [2025-03-17 11:45:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046564485] [2025-03-17 11:45:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:57,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:45:57,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:45:57,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:57,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:45:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046564485] [2025-03-17 11:45:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046564485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144126267] [2025-03-17 11:45:57,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:45:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:57,607 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 11:45:57,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:45:57,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:45:57,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:45:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:57,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 11:45:57,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:45:57,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:45:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 61 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:45:57,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:45:57,899 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 8 treesize of output 4 [2025-03-17 11:45:57,944 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 13 [2025-03-17 11:45:57,945 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 16 treesize of output 12 [2025-03-17 11:45:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 49 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 11:45:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144126267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:45:57,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:45:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 29 [2025-03-17 11:45:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777805261] [2025-03-17 11:45:57,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:45:57,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:45:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:45:57,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:45:57,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:45:57,998 INFO L87 Difference]: Start difference. First operand 759 states and 843 transitions. Second operand has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 29 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:45:58,415 INFO L93 Difference]: Finished difference Result 1322 states and 1448 transitions. [2025-03-17 11:45:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:45:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 29 states have internal predecessors, (137), 0 states have call successors, (0), 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 76 [2025-03-17 11:45:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:45:58,418 INFO L225 Difference]: With dead ends: 1322 [2025-03-17 11:45:58,418 INFO L226 Difference]: Without dead ends: 934 [2025-03-17 11:45:58,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 11:45:58,418 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:45:58,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 525 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:45:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-17 11:45:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 833. [2025-03-17 11:45:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.1155234657039712) internal successors, (927), 832 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 927 transitions. [2025-03-17 11:45:58,426 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 927 transitions. Word has length 76 [2025-03-17 11:45:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:45:58,427 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 927 transitions. [2025-03-17 11:45:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 29 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:45:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 927 transitions. [2025-03-17 11:45:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 11:45:58,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:45:58,428 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:45:58,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 11:45:58,629 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,SelfDestructingSolverStorable39 [2025-03-17 11:45:58,629 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:45:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:45:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash -410970613, now seen corresponding path program 12 times [2025-03-17 11:45:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:45:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879713121] [2025-03-17 11:45:58,629 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:45:58,637 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 8 equivalence classes. [2025-03-17 11:45:58,655 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 11:45:58,656 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 11:45:58,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:45:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:45:59,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879713121] [2025-03-17 11:45:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879713121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:45:59,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341640567] [2025-03-17 11:45:59,654 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:45:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:45:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:45:59,656 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:45:59,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 11:45:59,731 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 8 equivalence classes. [2025-03-17 11:45:59,841 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 11:45:59,841 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-17 11:45:59,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:45:59,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-17 11:45:59,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:00,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:46:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 26 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:46:00,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:00,234 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 13 [2025-03-17 11:46:00,235 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 16 treesize of output 12 [2025-03-17 11:46:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 159 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:00,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341640567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:00,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:00,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 22] total 44 [2025-03-17 11:46:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984079448] [2025-03-17 11:46:00,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:00,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 11:46:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:00,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 11:46:00,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1764, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 11:46:00,315 INFO L87 Difference]: Start difference. First operand 833 states and 927 transitions. Second operand has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 44 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:02,066 INFO L93 Difference]: Finished difference Result 1196 states and 1316 transitions. [2025-03-17 11:46:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-17 11:46:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 44 states have internal predecessors, (124), 0 states have call successors, (0), 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 77 [2025-03-17 11:46:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:02,068 INFO L225 Difference]: With dead ends: 1196 [2025-03-17 11:46:02,068 INFO L226 Difference]: Without dead ends: 1042 [2025-03-17 11:46:02,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=572, Invalid=9730, Unknown=0, NotChecked=0, Total=10302 [2025-03-17 11:46:02,069 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 266 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:02,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1154 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:46:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-17 11:46:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1016. [2025-03-17 11:46:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1014 states have (on average 1.116370808678501) internal successors, (1132), 1015 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1132 transitions. [2025-03-17 11:46:02,080 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1132 transitions. Word has length 77 [2025-03-17 11:46:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:02,080 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1132 transitions. [2025-03-17 11:46:02,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 44 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1132 transitions. [2025-03-17 11:46:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 11:46:02,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:02,081 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:02,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 11:46:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:02,282 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash -772367141, now seen corresponding path program 2 times [2025-03-17 11:46:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889530300] [2025-03-17 11:46:02,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:02,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-17 11:46:02,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 11:46:02,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 107 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:46:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889530300] [2025-03-17 11:46:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889530300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574382934] [2025-03-17 11:46:03,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:03,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:03,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:03,320 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:03,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 11:46:03,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-17 11:46:03,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 11:46:03,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:03,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:03,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-17 11:46:03,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:03,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:46:03,616 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 8 treesize of output 1 [2025-03-17 11:46:04,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:46:04,101 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 31 treesize of output 15 [2025-03-17 11:46:04,182 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 16 treesize of output 8 [2025-03-17 11:46:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:46:04,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:04,616 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 25 treesize of output 21 [2025-03-17 11:46:04,653 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 44 treesize of output 38 [2025-03-17 11:46:04,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:46:04,660 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 73 treesize of output 53 [2025-03-17 11:46:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 34 proven. 72 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:46:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574382934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:04,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 23] total 62 [2025-03-17 11:46:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48912489] [2025-03-17 11:46:04,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:04,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-17 11:46:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:04,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-17 11:46:04,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3567, Unknown=0, NotChecked=0, Total=3782 [2025-03-17 11:46:04,880 INFO L87 Difference]: Start difference. First operand 1016 states and 1132 transitions. Second operand has 62 states, 62 states have (on average 2.967741935483871) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:06,555 INFO L93 Difference]: Finished difference Result 4028 states and 4454 transitions. [2025-03-17 11:46:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 11:46:06,555 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.967741935483871) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 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 79 [2025-03-17 11:46:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:06,562 INFO L225 Difference]: With dead ends: 4028 [2025-03-17 11:46:06,562 INFO L226 Difference]: Without dead ends: 3980 [2025-03-17 11:46:06,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=496, Invalid=7514, Unknown=0, NotChecked=0, Total=8010 [2025-03-17 11:46:06,563 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 181 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:06,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 881 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:46:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2025-03-17 11:46:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3035. [2025-03-17 11:46:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3033 states have (on average 1.1097922848664687) internal successors, (3366), 3034 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 3366 transitions. [2025-03-17 11:46:06,594 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 3366 transitions. Word has length 79 [2025-03-17 11:46:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:06,594 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 3366 transitions. [2025-03-17 11:46:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.967741935483871) internal successors, (184), 62 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 3366 transitions. [2025-03-17 11:46:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 11:46:06,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:06,597 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:06,604 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 11:46:06,798 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,SelfDestructingSolverStorable41 [2025-03-17 11:46:06,798 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:06,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash -514873334, now seen corresponding path program 13 times [2025-03-17 11:46:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132417308] [2025-03-17 11:46:06,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:46:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:06,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:46:06,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:46:06,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:06,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 35 proven. 168 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:07,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132417308] [2025-03-17 11:46:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132417308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723443215] [2025-03-17 11:46:07,442 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:46:07,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:07,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:07,444 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:07,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 11:46:07,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:46:07,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:46:07,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:07,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:07,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-17 11:46:07,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 51 proven. 152 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:07,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:08,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:46:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 51 proven. 152 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723443215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:08,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 43 [2025-03-17 11:46:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763366820] [2025-03-17 11:46:08,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:08,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 11:46:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:08,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 11:46:08,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1676, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 11:46:08,223 INFO L87 Difference]: Start difference. First operand 3035 states and 3366 transitions. Second operand has 44 states, 43 states have (on average 3.9302325581395348) internal successors, (169), 44 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:08,745 INFO L93 Difference]: Finished difference Result 3289 states and 3645 transitions. [2025-03-17 11:46:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 11:46:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.9302325581395348) internal successors, (169), 44 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-17 11:46:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:08,750 INFO L225 Difference]: With dead ends: 3289 [2025-03-17 11:46:08,750 INFO L226 Difference]: Without dead ends: 3289 [2025-03-17 11:46:08,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=335, Invalid=2527, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 11:46:08,751 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 186 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:08,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 767 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:46:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2025-03-17 11:46:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3119. [2025-03-17 11:46:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 3117 states have (on average 1.111004170676933) internal successors, (3463), 3118 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 3463 transitions. [2025-03-17 11:46:08,793 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 3463 transitions. Word has length 80 [2025-03-17 11:46:08,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:08,794 INFO L471 AbstractCegarLoop]: Abstraction has 3119 states and 3463 transitions. [2025-03-17 11:46:08,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.9302325581395348) internal successors, (169), 44 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:08,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 3463 transitions. [2025-03-17 11:46:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 11:46:08,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:08,796 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:08,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-17 11:46:08,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:08,997 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1389590428, now seen corresponding path program 3 times [2025-03-17 11:46:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473680234] [2025-03-17 11:46:08,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:09,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 6 equivalence classes. [2025-03-17 11:46:09,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 76 of 82 statements. [2025-03-17 11:46:09,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 11:46:09,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 5 proven. 111 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:46:09,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473680234] [2025-03-17 11:46:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473680234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112988466] [2025-03-17 11:46:09,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:09,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:09,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:09,301 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:09,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 11:46:09,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 6 equivalence classes. [2025-03-17 11:46:09,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 76 of 82 statements. [2025-03-17 11:46:09,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 11:46:09,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:09,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:46:09,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 104 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:46:09,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:09,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:46:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 104 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:46:09,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112988466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:09,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2025-03-17 11:46:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613883405] [2025-03-17 11:46:09,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:09,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:46:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:09,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:46:09,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:46:09,894 INFO L87 Difference]: Start difference. First operand 3119 states and 3463 transitions. Second operand has 28 states, 27 states have (on average 5.962962962962963) internal successors, (161), 28 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 11:46:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:10,130 INFO L93 Difference]: Finished difference Result 6060 states and 6735 transitions. [2025-03-17 11:46:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:46:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.962962962962963) internal successors, (161), 28 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) Word has length 82 [2025-03-17 11:46:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:10,141 INFO L225 Difference]: With dead ends: 6060 [2025-03-17 11:46:10,141 INFO L226 Difference]: Without dead ends: 6060 [2025-03-17 11:46:10,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:46:10,141 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 89 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:10,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 384 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:46:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2025-03-17 11:46:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3384. [2025-03-17 11:46:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 3382 states have (on average 1.111176818450621) internal successors, (3758), 3383 states have internal predecessors, (3758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 3758 transitions. [2025-03-17 11:46:10,190 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 3758 transitions. Word has length 82 [2025-03-17 11:46:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:10,190 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 3758 transitions. [2025-03-17 11:46:10,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.962962962962963) internal successors, (161), 28 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 11:46:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3758 transitions. [2025-03-17 11:46:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 11:46:10,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:10,194 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:10,203 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 11:46:10,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:10,398 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:10,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash -322377600, now seen corresponding path program 4 times [2025-03-17 11:46:10,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:10,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918056871] [2025-03-17 11:46:10,398 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:46:10,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:10,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-17 11:46:10,415 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 72 of 85 statements. [2025-03-17 11:46:10,415 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:46:10,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 11:46:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:11,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918056871] [2025-03-17 11:46:11,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918056871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:11,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818223542] [2025-03-17 11:46:11,541 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:46:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:11,543 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:11,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 11:46:11,627 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-17 11:46:11,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 72 of 85 statements. [2025-03-17 11:46:11,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:46:11,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:11,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-17 11:46:11,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:11,693 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 14 treesize of output 10 [2025-03-17 11:46:14,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:46:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 167 [2025-03-17 11:46:14,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:46:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 48 [2025-03-17 11:46:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 6 proven. 112 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 11:46:14,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:16,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:46:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 68 [2025-03-17 11:46:16,972 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 72 treesize of output 62 [2025-03-17 11:46:16,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 123 [2025-03-17 11:46:16,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:46:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 11:46:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818223542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:17,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 75 [2025-03-17 11:46:17,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386126042] [2025-03-17 11:46:17,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:17,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-17 11:46:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:17,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-17 11:46:17,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=5088, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 11:46:17,013 INFO L87 Difference]: Start difference. First operand 3384 states and 3758 transitions. Second operand has 76 states, 75 states have (on average 2.506666666666667) internal successors, (188), 76 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:26,787 INFO L93 Difference]: Finished difference Result 7847 states and 8642 transitions. [2025-03-17 11:46:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-17 11:46:26,788 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 2.506666666666667) internal successors, (188), 76 states have internal predecessors, (188), 0 states have call successors, (0), 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 85 [2025-03-17 11:46:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:26,792 INFO L225 Difference]: With dead ends: 7847 [2025-03-17 11:46:26,792 INFO L226 Difference]: Without dead ends: 2187 [2025-03-17 11:46:26,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3533 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=3452, Invalid=14104, Unknown=0, NotChecked=0, Total=17556 [2025-03-17 11:46:26,793 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 280 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:26,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 678 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1796 Invalid, 2 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 11:46:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-03-17 11:46:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 523. [2025-03-17 11:46:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.1226053639846743) internal successors, (586), 522 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 586 transitions. [2025-03-17 11:46:26,800 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 586 transitions. Word has length 85 [2025-03-17 11:46:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:26,800 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 586 transitions. [2025-03-17 11:46:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 2.506666666666667) internal successors, (188), 76 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 586 transitions. [2025-03-17 11:46:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 11:46:26,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:26,802 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:26,809 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 11:46:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:27,003 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1411000111, now seen corresponding path program 14 times [2025-03-17 11:46:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3373851] [2025-03-17 11:46:27,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:27,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-17 11:46:27,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:46:27,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 29 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3373851] [2025-03-17 11:46:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3373851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502093872] [2025-03-17 11:46:27,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:27,461 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:27,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 11:46:27,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-17 11:46:27,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:46:27,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:27,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:27,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-17 11:46:27,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:27,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:46:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 29 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:27,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:27,708 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 13 [2025-03-17 11:46:27,709 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 16 treesize of output 12 [2025-03-17 11:46:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 29 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:27,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502093872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:27,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 27 [2025-03-17 11:46:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724921554] [2025-03-17 11:46:27,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 11:46:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:27,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 11:46:27,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:46:27,761 INFO L87 Difference]: Start difference. First operand 523 states and 586 transitions. Second operand has 27 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:28,257 INFO L93 Difference]: Finished difference Result 967 states and 1070 transitions. [2025-03-17 11:46:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 11:46:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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 86 [2025-03-17 11:46:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:28,259 INFO L225 Difference]: With dead ends: 967 [2025-03-17 11:46:28,259 INFO L226 Difference]: Without dead ends: 543 [2025-03-17 11:46:28,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=1675, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:46:28,259 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 80 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:28,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 841 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:46:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-17 11:46:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 535. [2025-03-17 11:46:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.1198501872659177) internal successors, (598), 534 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 598 transitions. [2025-03-17 11:46:28,262 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 598 transitions. Word has length 86 [2025-03-17 11:46:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:28,263 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 598 transitions. [2025-03-17 11:46:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 598 transitions. [2025-03-17 11:46:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 11:46:28,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:28,263 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:28,271 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 11:46:28,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:28,464 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:28,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1883661328, now seen corresponding path program 15 times [2025-03-17 11:46:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:28,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146077702] [2025-03-17 11:46:28,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:28,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 9 equivalence classes. [2025-03-17 11:46:28,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:46:28,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 11:46:28,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 51 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146077702] [2025-03-17 11:46:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146077702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927213863] [2025-03-17 11:46:28,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:28,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:28,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:28,973 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:28,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 11:46:29,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 9 equivalence classes. [2025-03-17 11:46:29,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:46:29,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 11:46:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:29,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-17 11:46:29,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 70 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:29,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:29,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:46:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 70 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:29,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927213863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:29,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 47 [2025-03-17 11:46:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913172556] [2025-03-17 11:46:29,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 11:46:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:29,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 11:46:29,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 11:46:29,683 INFO L87 Difference]: Start difference. First operand 535 states and 598 transitions. Second operand has 48 states, 47 states have (on average 3.978723404255319) internal successors, (187), 48 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:29,992 INFO L93 Difference]: Finished difference Result 665 states and 740 transitions. [2025-03-17 11:46:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:46:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.978723404255319) internal successors, (187), 48 states have internal predecessors, (187), 0 states have call successors, (0), 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 89 [2025-03-17 11:46:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:29,993 INFO L225 Difference]: With dead ends: 665 [2025-03-17 11:46:29,993 INFO L226 Difference]: Without dead ends: 665 [2025-03-17 11:46:29,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 144 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=527, Invalid=2895, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 11:46:29,994 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 421 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:29,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 240 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:46:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-17 11:46:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 577. [2025-03-17 11:46:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.1215277777777777) internal successors, (646), 576 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 646 transitions. [2025-03-17 11:46:30,005 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 646 transitions. Word has length 89 [2025-03-17 11:46:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 646 transitions. [2025-03-17 11:46:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.978723404255319) internal successors, (187), 48 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 646 transitions. [2025-03-17 11:46:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 11:46:30,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:30,006 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:30,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-17 11:46:30,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-17 11:46:30,206 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:30,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1552333131, now seen corresponding path program 16 times [2025-03-17 11:46:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883709584] [2025-03-17 11:46:30,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:46:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:30,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-17 11:46:30,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 75 of 95 statements. [2025-03-17 11:46:30,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:46:30,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883709584] [2025-03-17 11:46:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883709584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542475783] [2025-03-17 11:46:32,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:46:32,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:32,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:32,229 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:32,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 11:46:32,324 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-17 11:46:32,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 75 of 95 statements. [2025-03-17 11:46:32,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:46:32,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:32,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-17 11:46:32,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:32,729 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 14 treesize of output 10 [2025-03-17 11:46:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 209 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:35,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:35,669 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 134 treesize of output 116 [2025-03-17 11:46:35,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:46:35,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 100 [2025-03-17 11:46:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542475783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:36,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:36,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2025-03-17 11:46:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781107612] [2025-03-17 11:46:36,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-17 11:46:36,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:36,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-17 11:46:36,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=8680, Unknown=0, NotChecked=0, Total=9900 [2025-03-17 11:46:36,570 INFO L87 Difference]: Start difference. First operand 577 states and 646 transitions. Second operand has 100 states, 100 states have (on average 1.96) internal successors, (196), 100 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:38,674 INFO L93 Difference]: Finished difference Result 1069 states and 1184 transitions. [2025-03-17 11:46:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 11:46:38,674 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.96) internal successors, (196), 100 states have internal predecessors, (196), 0 states have call successors, (0), 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 95 [2025-03-17 11:46:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:38,675 INFO L225 Difference]: With dead ends: 1069 [2025-03-17 11:46:38,676 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 11:46:38,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6792 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2239, Invalid=16121, Unknown=0, NotChecked=0, Total=18360 [2025-03-17 11:46:38,676 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:38,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 516 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:46:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 11:46:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2025-03-17 11:46:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.119047619047619) internal successors, (658), 588 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 658 transitions. [2025-03-17 11:46:38,680 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 658 transitions. Word has length 95 [2025-03-17 11:46:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:38,680 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 658 transitions. [2025-03-17 11:46:38,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 1.96) internal successors, (196), 100 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 658 transitions. [2025-03-17 11:46:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 11:46:38,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:38,681 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:38,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-17 11:46:38,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-17 11:46:38,881 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:38,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1675425524, now seen corresponding path program 17 times [2025-03-17 11:46:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:38,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531802382] [2025-03-17 11:46:38,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:46:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:38,892 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 10 equivalence classes. [2025-03-17 11:46:38,903 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:46:38,903 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-17 11:46:38,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 92 proven. 250 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531802382] [2025-03-17 11:46:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531802382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60190522] [2025-03-17 11:46:39,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:46:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:39,383 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:39,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 11:46:39,485 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 10 equivalence classes. [2025-03-17 11:46:39,542 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:46:39,542 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-17 11:46:39,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:39,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-17 11:46:39,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:39,551 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 13 treesize of output 1 [2025-03-17 11:46:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 92 proven. 250 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:39,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 92 proven. 250 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60190522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:40,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:40,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 60 [2025-03-17 11:46:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733993234] [2025-03-17 11:46:40,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:40,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-17 11:46:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:40,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-17 11:46:40,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=3234, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 11:46:40,682 INFO L87 Difference]: Start difference. First operand 589 states and 658 transitions. Second operand has 61 states, 60 states have (on average 3.95) internal successors, (237), 61 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:41,374 INFO L93 Difference]: Finished difference Result 725 states and 806 transitions. [2025-03-17 11:46:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 11:46:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.95) internal successors, (237), 61 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-17 11:46:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:41,375 INFO L225 Difference]: With dead ends: 725 [2025-03-17 11:46:41,375 INFO L226 Difference]: Without dead ends: 725 [2025-03-17 11:46:41,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=592, Invalid=4664, Unknown=0, NotChecked=0, Total=5256 [2025-03-17 11:46:41,376 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 232 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:41,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 976 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:46:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-17 11:46:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 631. [2025-03-17 11:46:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.1206349206349207) internal successors, (706), 630 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 706 transitions. [2025-03-17 11:46:41,381 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 706 transitions. Word has length 98 [2025-03-17 11:46:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 706 transitions. [2025-03-17 11:46:41,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.95) internal successors, (237), 61 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 706 transitions. [2025-03-17 11:46:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 11:46:41,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:41,382 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:41,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-17 11:46:41,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-17 11:46:41,583 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:41,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2036801177, now seen corresponding path program 18 times [2025-03-17 11:46:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934744006] [2025-03-17 11:46:41,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:46:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:41,592 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 11 equivalence classes. [2025-03-17 11:46:41,613 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:46:41,613 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-17 11:46:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 70 proven. 327 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:42,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934744006] [2025-03-17 11:46:42,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934744006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:42,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139745800] [2025-03-17 11:46:42,453 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:46:42,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:42,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:42,454 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:42,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 11:46:42,562 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 104 statements into 11 equivalence classes. [2025-03-17 11:46:42,737 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:46:42,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-17 11:46:42,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-17 11:46:42,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:42,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:46:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 37 proven. 360 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:43,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:43,331 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 13 [2025-03-17 11:46:43,333 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 16 treesize of output 12 [2025-03-17 11:46:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 37 proven. 360 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139745800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:43,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 58 [2025-03-17 11:46:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363489919] [2025-03-17 11:46:43,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:43,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-17 11:46:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:43,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-17 11:46:43,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3062, Unknown=0, NotChecked=0, Total=3306 [2025-03-17 11:46:43,414 INFO L87 Difference]: Start difference. First operand 631 states and 706 transitions. Second operand has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:45,279 INFO L93 Difference]: Finished difference Result 1313 states and 1452 transitions. [2025-03-17 11:46:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-17 11:46:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 states have internal predecessors, (209), 0 states have call successors, (0), 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 104 [2025-03-17 11:46:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:45,281 INFO L225 Difference]: With dead ends: 1313 [2025-03-17 11:46:45,281 INFO L226 Difference]: Without dead ends: 793 [2025-03-17 11:46:45,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2753 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=966, Invalid=10376, Unknown=0, NotChecked=0, Total=11342 [2025-03-17 11:46:45,282 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 511 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:45,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1456 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:46:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-17 11:46:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 685. [2025-03-17 11:46:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.1198830409356726) internal successors, (766), 684 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 766 transitions. [2025-03-17 11:46:45,287 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 766 transitions. Word has length 104 [2025-03-17 11:46:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:45,287 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 766 transitions. [2025-03-17 11:46:45,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 766 transitions. [2025-03-17 11:46:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 11:46:45,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:45,288 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:45,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-17 11:46:45,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-17 11:46:45,489 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:45,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1014488993, now seen corresponding path program 19 times [2025-03-17 11:46:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:45,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392226583] [2025-03-17 11:46:45,489 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:46:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:45,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:46:45,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:46:45,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:45,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 41 proven. 445 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392226583] [2025-03-17 11:46:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392226583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869650034] [2025-03-17 11:46:46,192 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:46:46,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:46,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:46,194 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:46,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 11:46:46,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:46:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:46:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:46:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:46,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-17 11:46:46,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:46,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:46:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 41 proven. 445 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:46,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:46,726 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 13 [2025-03-17 11:46:46,727 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 16 treesize of output 12 [2025-03-17 11:46:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 41 proven. 445 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869650034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:46,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 49 [2025-03-17 11:46:46,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632019131] [2025-03-17 11:46:46,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:46,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 11:46:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:46,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 11:46:46,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2213, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 11:46:46,800 INFO L87 Difference]: Start difference. First operand 685 states and 766 transitions. Second operand has 49 states, 49 states have (on average 3.3877551020408165) internal successors, (166), 49 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:47,804 INFO L93 Difference]: Finished difference Result 1273 states and 1412 transitions. [2025-03-17 11:46:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 11:46:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.3877551020408165) internal successors, (166), 49 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-17 11:46:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:47,806 INFO L225 Difference]: With dead ends: 1273 [2025-03-17 11:46:47,806 INFO L226 Difference]: Without dead ends: 705 [2025-03-17 11:46:47,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=4965, Unknown=0, NotChecked=0, Total=5256 [2025-03-17 11:46:47,807 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 122 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:47,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1576 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:46:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-17 11:46:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 697. [2025-03-17 11:46:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.117816091954023) internal successors, (778), 696 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 778 transitions. [2025-03-17 11:46:47,812 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 778 transitions. Word has length 113 [2025-03-17 11:46:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:47,812 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 778 transitions. [2025-03-17 11:46:47,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.3877551020408165) internal successors, (166), 49 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 778 transitions. [2025-03-17 11:46:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 11:46:47,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:47,813 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:47,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-17 11:46:48,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:48,018 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash 290315998, now seen corresponding path program 20 times [2025-03-17 11:46:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:48,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859877421] [2025-03-17 11:46:48,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:48,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-17 11:46:48,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:46:48,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:48,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 117 proven. 400 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:46:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859877421] [2025-03-17 11:46:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859877421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:46:48,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804128560] [2025-03-17 11:46:48,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:46:48,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:46:48,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:46:48,805 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:46:48,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-17 11:46:48,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-17 11:46:48,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:46:48,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:46:48,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:46:48,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-17 11:46:48,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:46:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 145 proven. 372 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:49,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:46:49,840 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 21 treesize of output 17 [2025-03-17 11:46:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 145 proven. 372 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:46:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804128560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:46:50,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:46:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 71 [2025-03-17 11:46:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159423329] [2025-03-17 11:46:50,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:46:50,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-17 11:46:50,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:46:50,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-17 11:46:50,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=4438, Unknown=0, NotChecked=0, Total=5112 [2025-03-17 11:46:50,234 INFO L87 Difference]: Start difference. First operand 697 states and 778 transitions. Second operand has 72 states, 71 states have (on average 3.9577464788732395) internal successors, (281), 72 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:46:51,050 INFO L93 Difference]: Finished difference Result 845 states and 938 transitions. [2025-03-17 11:46:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 11:46:51,050 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 3.9577464788732395) internal successors, (281), 72 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-17 11:46:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:46:51,052 INFO L225 Difference]: With dead ends: 845 [2025-03-17 11:46:51,052 INFO L226 Difference]: Without dead ends: 845 [2025-03-17 11:46:51,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2446 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=883, Invalid=6427, Unknown=0, NotChecked=0, Total=7310 [2025-03-17 11:46:51,053 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:46:51,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1070 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:46:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-17 11:46:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 739. [2025-03-17 11:46:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.119241192411924) internal successors, (826), 738 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 826 transitions. [2025-03-17 11:46:51,059 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 826 transitions. Word has length 116 [2025-03-17 11:46:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:46:51,059 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 826 transitions. [2025-03-17 11:46:51,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.9577464788732395) internal successors, (281), 72 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:46:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 826 transitions. [2025-03-17 11:46:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 11:46:51,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:46:51,062 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:46:51,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-17 11:46:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-03-17 11:46:51,263 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 11:46:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:46:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1824583427, now seen corresponding path program 21 times [2025-03-17 11:46:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:46:51,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285065287] [2025-03-17 11:46:51,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:46:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:46:51,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 13 equivalence classes. [2025-03-17 11:46:51,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:46:51,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-17 11:46:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat