./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/openbsd_cstpncpy-alloca-1.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 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:27:48,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:27:49,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:27:49,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:27:49,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:27:49,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:27:49,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:27:49,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:27:49,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:27:49,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:27:49,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:27:49,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:27:49,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:27:49,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:27:49,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:27:49,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:27:49,076 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:27:49,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:27:49,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:27:49,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:27:49,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:27:49,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:27:49,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:27:49,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:27:49,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:27:49,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:27:49,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:27:49,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:27:49,079 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2025-03-04 07:27:49,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:27:49,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:27:49,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:27:49,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:27:49,308 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:27:49,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2025-03-04 07:27:50,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4dab523/6bc8f429723a49a0b014c6696780138b/FLAG2a40dc09e [2025-03-04 07:27:50,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:27:50,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2025-03-04 07:27:50,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4dab523/6bc8f429723a49a0b014c6696780138b/FLAG2a40dc09e [2025-03-04 07:27:51,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4dab523/6bc8f429723a49a0b014c6696780138b [2025-03-04 07:27:51,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:27:51,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:27:51,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:27:51,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:27:51,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:27:51,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322b4289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51, skipping insertion in model container [2025-03-04 07:27:51,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:27:51,253 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-04 07:27:51,254 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-04 07:27:51,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:27:51,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:27:51,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:27:51,308 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:27:51,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51 WrapperNode [2025-03-04 07:27:51,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:27:51,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:27:51,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:27:51,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:27:51,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,332 INFO L138 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2025-03-04 07:27:51,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:27:51,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:27:51,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:27:51,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:27:51,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,356 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-04 07:27:51,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:27:51,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:27:51,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:27:51,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:27:51,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (1/1) ... [2025-03-04 07:27:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:27:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:51,395 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-04 07:27:51,398 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-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:27:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:27:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:27:51,496 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:27:51,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:27:51,632 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset; [2025-03-04 07:27:51,640 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-04 07:27:51,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:27:51,646 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:27:51,647 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:27:51,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:27:51 BoogieIcfgContainer [2025-03-04 07:27:51,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:27:51,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:27:51,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:27:51,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:27:51,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:27:51" (1/3) ... [2025-03-04 07:27:51,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b06e0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:27:51, skipping insertion in model container [2025-03-04 07:27:51,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:27:51" (2/3) ... [2025-03-04 07:27:51,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b06e0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:27:51, skipping insertion in model container [2025-03-04 07:27:51,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:27:51" (3/3) ... [2025-03-04 07:27:51,654 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2025-03-04 07:27:51,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:27:51,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstpncpy-alloca-1.i that has 1 procedures, 36 locations, 1 initial locations, 3 loop locations, and 11 error locations. [2025-03-04 07:27:51,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:27:51,708 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;@7ce6b43d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:27:51,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 07:27:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 35 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-04 07:27:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:51,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:51,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:51,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -596115029, now seen corresponding path program 1 times [2025-03-04 07:27:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097050405] [2025-03-04 07:27:51,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:51,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:51,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:51,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:51,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:51,937 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-04 07:27:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097050405] [2025-03-04 07:27:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097050405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:51,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:27:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854379226] [2025-03-04 07:27:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:51,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:27:51,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:51,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:27:51,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:27:51,966 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 35 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:52,005 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-04 07:27:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:27:52,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:27:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:52,013 INFO L225 Difference]: With dead ends: 34 [2025-03-04 07:27:52,013 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:27:52,014 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-04 07:27:52,017 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:52,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:27:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 07:27:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-04 07:27:52,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-03-04 07:27:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:52,041 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-04 07:27:52,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-04 07:27:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:52,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:52,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:27:52,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash -596115028, now seen corresponding path program 1 times [2025-03-04 07:27:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391928254] [2025-03-04 07:27:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:52,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:52,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:52,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,228 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-04 07:27:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391928254] [2025-03-04 07:27:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391928254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:27:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543144743] [2025-03-04 07:27:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:52,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:52,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:52,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:52,230 INFO L87 Difference]: Start difference. First operand 32 states and 38 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-04 07:27:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:52,279 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-04 07:27:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:52,279 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-04 07:27:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:52,279 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:27:52,279 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:27:52,280 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-04 07:27:52,280 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:52,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:27:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-03-04 07:27:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-03-04 07:27:52,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 7 [2025-03-04 07:27:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:52,285 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-03-04 07:27:52,285 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-04 07:27:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2025-03-04 07:27:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:52,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:52,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:27:52,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -596114868, now seen corresponding path program 1 times [2025-03-04 07:27:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-03-04 07:27:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:52,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:52,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:52,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,329 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-04 07:27:52,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-03-04 07:27:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116214797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842603899] [2025-03-04 07:27:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:52,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:52,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:52,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:52,330 INFO L87 Difference]: Start difference. First operand 38 states and 47 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-04 07:27:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:52,351 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-04 07:27:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:52,351 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-04 07:27:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:52,352 INFO L225 Difference]: With dead ends: 36 [2025-03-04 07:27:52,352 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 07:27:52,352 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-04 07:27:52,352 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:52,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 07:27:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 07:27:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-04 07:27:52,355 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2025-03-04 07:27:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:52,355 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-04 07:27:52,355 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-04 07:27:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-04 07:27:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:52,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:52,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:52,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:27:52,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash -595191507, now seen corresponding path program 1 times [2025-03-04 07:27:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-04 07:27:52,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:52,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:52,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:52,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,464 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-04 07:27:52,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-04 07:27:52,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:52,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:52,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211621101] [2025-03-04 07:27:52,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:52,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:52,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:52,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:52,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:52,465 INFO L87 Difference]: Start difference. First operand 36 states and 43 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-04 07:27:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:52,490 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-04 07:27:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:52,490 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-04 07:27:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:52,491 INFO L225 Difference]: With dead ends: 35 [2025-03-04 07:27:52,491 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 07:27:52,491 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-04 07:27:52,491 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:52,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 07:27:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-04 07:27:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-04 07:27:52,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 7 [2025-03-04 07:27:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:52,497 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-04 07:27:52,497 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-04 07:27:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-04 07:27:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:27:52,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:52,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:52,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:27:52,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:52,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -595191347, now seen corresponding path program 1 times [2025-03-04 07:27:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215496738] [2025-03-04 07:27:52,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:27:52,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:27:52,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:52,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,626 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-04 07:27:52,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215496738] [2025-03-04 07:27:52,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215496738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:52,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3915380] [2025-03-04 07:27:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:52,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:52,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:52,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:52,627 INFO L87 Difference]: Start difference. First operand 34 states and 41 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-04 07:27:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:52,691 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-03-04 07:27:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:52,692 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-04 07:27:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:52,692 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:27:52,692 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 07:27:52,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-04 07:27:52,693 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:52,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 76 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 07:27:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-04 07:27:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 35 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-04 07:27:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-04 07:27:52,695 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 7 [2025-03-04 07:27:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:52,695 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-04 07:27:52,695 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-04 07:27:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-04 07:27:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:27:52,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:52,699 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:52,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:27:52,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:52,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1720442310, now seen corresponding path program 1 times [2025-03-04 07:27:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964104188] [2025-03-04 07:27:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,916 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-04 07:27:52,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964104188] [2025-03-04 07:27:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964104188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356848777] [2025-03-04 07:27:52,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:52,920 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-04 07:27:52,921 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-04 07:27:52,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:27:52,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:27:52,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:52,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:27:52,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:53,019 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-04 07:27:53,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:27:53,144 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-04 07:27:53,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:53,248 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-04 07:27:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356848777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:53,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 07:27:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583530536] [2025-03-04 07:27:53,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:53,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:27:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:27:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:27:53,249 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:53,394 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-04 07:27:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:27:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:27:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:53,396 INFO L225 Difference]: With dead ends: 37 [2025-03-04 07:27:53,396 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 07:27:53,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:27:53,398 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:53,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 07:27:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-03-04 07:27:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-04 07:27:53,401 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 10 [2025-03-04 07:27:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:53,401 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-04 07:27:53,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-04 07:27:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:27:53,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:53,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:53,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:27:53,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:27:53,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:53,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -134572826, now seen corresponding path program 1 times [2025-03-04 07:27:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446180846] [2025-03-04 07:27:53,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:53,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:27:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:27:53,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:53,670 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-04 07:27:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446180846] [2025-03-04 07:27:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446180846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:53,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:27:53,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23624267] [2025-03-04 07:27:53,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:53,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:27:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:53,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:27:53,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:27:53,672 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:53,721 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-04 07:27:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:53,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:27:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:53,722 INFO L225 Difference]: With dead ends: 34 [2025-03-04 07:27:53,722 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 07:27:53,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:53,722 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:53,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 07:27:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-04 07:27:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-04 07:27:53,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 11 [2025-03-04 07:27:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:53,724 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-04 07:27:53,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-04 07:27:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:27:53,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:53,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:53,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:27:53,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -134572825, now seen corresponding path program 1 times [2025-03-04 07:27:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342406315] [2025-03-04 07:27:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:27:53,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:27:53,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:53,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:53,842 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-04 07:27:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342406315] [2025-03-04 07:27:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342406315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:27:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735905508] [2025-03-04 07:27:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:27:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:53,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:27:53,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:27:53,843 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:53,916 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-04 07:27:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:27:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:27:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:53,916 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:27:53,916 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:27:53,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:53,917 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:53,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:27:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-04 07:27:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-04 07:27:53,919 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2025-03-04 07:27:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:53,919 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-04 07:27:53,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-04 07:27:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:53,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:53,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:53,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:27:53,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 123216666, now seen corresponding path program 1 times [2025-03-04 07:27:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628514894] [2025-03-04 07:27:53,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:53,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:53,974 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-04 07:27:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628514894] [2025-03-04 07:27:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628514894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821648833] [2025-03-04 07:27:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:53,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:53,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:53,975 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:53,994 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-03-04 07:27:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:27:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:53,995 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:27:53,995 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:27:53,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:53,995 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:53,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:27:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2025-03-04 07:27:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3783783783783783) 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-04 07:27:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-04 07:27:53,998 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 12 [2025-03-04 07:27:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:53,998 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-04 07:27:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-04 07:27:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:53,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:53,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:53,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:27:53,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:53,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash 123209683, now seen corresponding path program 1 times [2025-03-04 07:27:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31145527] [2025-03-04 07:27:54,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:54,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,101 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-04 07:27:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31145527] [2025-03-04 07:27:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31145527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:27:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952568272] [2025-03-04 07:27:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:27:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:27:54,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:54,103 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,153 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-03-04 07:27:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:54,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:27:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,154 INFO L225 Difference]: With dead ends: 42 [2025-03-04 07:27:54,154 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 07:27:54,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:54,155 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:54,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 07:27:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 07:27:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-04 07:27:54,161 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 12 [2025-03-04 07:27:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-04 07:27:54,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-04 07:27:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:54,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:27:54,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 123209684, now seen corresponding path program 1 times [2025-03-04 07:27:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472875441] [2025-03-04 07:27:54,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:54,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,313 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-04 07:27:54,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472875441] [2025-03-04 07:27:54,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472875441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:27:54,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261457353] [2025-03-04 07:27:54,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:27:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:27:54,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:54,314 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,372 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-04 07:27:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:27:54,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:27:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,373 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:27:54,373 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:27:54,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:27:54,373 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:54,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:27:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 07:27:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-04 07:27:54,378 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2025-03-04 07:27:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,378 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-04 07:27:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-03-04 07:27:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:54,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:27:54,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1684237797, now seen corresponding path program 1 times [2025-03-04 07:27:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361028021] [2025-03-04 07:27:54,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:54,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:54,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,449 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-04 07:27:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361028021] [2025-03-04 07:27:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361028021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:27:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257441671] [2025-03-04 07:27:54,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:54,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:54,450 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,465 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-04 07:27:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:27:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,466 INFO L225 Difference]: With dead ends: 49 [2025-03-04 07:27:54,466 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 07:27:54,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:54,466 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:54,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 07:27:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2025-03-04 07:27:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-04 07:27:54,468 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 12 [2025-03-04 07:27:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,468 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-04 07:27:54,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-04 07:27:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:27:54,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:27:54,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1684244779, now seen corresponding path program 1 times [2025-03-04 07:27:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595307782] [2025-03-04 07:27:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:27:54,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:27:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,638 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-04 07:27:54,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595307782] [2025-03-04 07:27:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595307782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:27:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681247168] [2025-03-04 07:27:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:27:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:27:54,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:27:54,640 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,684 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-03-04 07:27:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:27:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:27:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,685 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:27:54,685 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:27:54,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:27:54,686 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:54,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:27:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2025-03-04 07:27:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-04 07:27:54,687 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 12 [2025-03-04 07:27:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,687 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-04 07:27:54,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-04 07:27:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:27:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:27:54,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:54,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash 160771051, now seen corresponding path program 1 times [2025-03-04 07:27:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648032624] [2025-03-04 07:27:54,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:27:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:27:54,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,741 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-04 07:27:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648032624] [2025-03-04 07:27:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648032624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:27:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593885462] [2025-03-04 07:27:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:54,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:54,743 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,788 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-04 07:27:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:27:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:27:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,788 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:27:54,788 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:27:54,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:27:54,789 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:54,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 69 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:27:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 07:27:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-04 07:27:54,790 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 16 [2025-03-04 07:27:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,790 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-04 07:27:54,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-04 07:27:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:27:54,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:27:54,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:54,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash 160771052, now seen corresponding path program 1 times [2025-03-04 07:27:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-03-04 07:27:54,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:27:54,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:27:54,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,878 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-04 07:27:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672514256] [2025-03-04 07:27:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672514256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:27:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744560700] [2025-03-04 07:27:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:54,879 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:54,902 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-03-04 07:27:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:27:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:54,903 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:27:54,903 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:27:54,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:54,903 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 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-04 07:27:54,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:27:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 07:27:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2727272727272727) 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-04 07:27:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-04 07:27:54,905 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 16 [2025-03-04 07:27:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:54,905 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-04 07:27:54,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-04 07:27:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:27:54,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:54,906 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:54,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:27:54,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:54,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 160821411, now seen corresponding path program 1 times [2025-03-04 07:27:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427080969] [2025-03-04 07:27:54,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:54,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:27:54,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:27:54,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427080969] [2025-03-04 07:27:54,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427080969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:54,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:27:54,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560826882] [2025-03-04 07:27:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:54,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:27:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:54,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:27:54,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:54,994 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:55,014 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-04 07:27:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:27:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:27:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:55,015 INFO L225 Difference]: With dead ends: 49 [2025-03-04 07:27:55,015 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 07:27:55,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:27:55,016 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 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-04 07:27:55,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 07:27:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 07:27:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2666666666666666) 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-04 07:27:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-04 07:27:55,018 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 16 [2025-03-04 07:27:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:55,018 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-04 07:27:55,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-04 07:27:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:27:55,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:55,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:55,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:27:55,019 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:55,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash -132631955, now seen corresponding path program 1 times [2025-03-04 07:27:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004865933] [2025-03-04 07:27:55,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:27:55,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:27:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:55,292 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-04 07:27:55,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:55,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004865933] [2025-03-04 07:27:55,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004865933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:27:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690194587] [2025-03-04 07:27:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:55,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:27:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:55,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:27:55,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:55,293 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:55,386 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-04 07:27:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:27:55,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:27:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:55,387 INFO L225 Difference]: With dead ends: 53 [2025-03-04 07:27:55,387 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 07:27:55,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:55,388 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:55,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 07:27:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 07:27:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 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-04 07:27:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-04 07:27:55,389 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 16 [2025-03-04 07:27:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 07:27:55,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-04 07:27:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:27:55,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:55,390 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:55,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:27:55,390 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:55,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash -132581596, now seen corresponding path program 1 times [2025-03-04 07:27:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-04 07:27:55,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:55,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:27:55,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:27:55,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:55,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-04 07:27:55,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897465717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:55,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:55,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:27:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797132353] [2025-03-04 07:27:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:55,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:27:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:55,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:27:55,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:55,551 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:55,594 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-03-04 07:27:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:27:55,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:27:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:55,595 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:27:55,595 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:27:55,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:27:55,596 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:55,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:27:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 07:27:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 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-04 07:27:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-03-04 07:27:55,598 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 16 [2025-03-04 07:27:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:55,598 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-03-04 07:27:55,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-03-04 07:27:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:27:55,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:55,598 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:55,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:27:55,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:55,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash -638140221, now seen corresponding path program 1 times [2025-03-04 07:27:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-03-04 07:27:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:55,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:27:55,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:27:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:55,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-03-04 07:27:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156491126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:55,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:55,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:27:55,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039174] [2025-03-04 07:27:55,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:55,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:27:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:55,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:27:55,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:27:55,778 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:55,834 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2025-03-04 07:27:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:27:55,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:27:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:55,835 INFO L225 Difference]: With dead ends: 87 [2025-03-04 07:27:55,835 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 07:27:55,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:27:55,835 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:55,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 07:27:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2025-03-04 07:27:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 68 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-04 07:27:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2025-03-04 07:27:55,837 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 16 [2025-03-04 07:27:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:55,837 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2025-03-04 07:27:55,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2025-03-04 07:27:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:27:55,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:55,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:55,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:27:55,839 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash 640778716, now seen corresponding path program 1 times [2025-03-04 07:27:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-04 07:27:55,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:55,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:55,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:55,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:55,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:55,921 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-04 07:27:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-04 07:27:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354634405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:27:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:27:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:27:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085792694] [2025-03-04 07:27:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:27:55,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:27:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:55,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:27:55,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:55,924 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:55,936 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-03-04 07:27:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:27:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:27:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:55,937 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:27:55,937 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 07:27:55,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:27:55,937 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:55,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:27:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 07:27:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 07:27:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-04 07:27:55,939 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 19 [2025-03-04 07:27:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:55,939 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-04 07:27:55,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-03-04 07:27:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:27:55,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:55,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:27:55,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 131299171, now seen corresponding path program 1 times [2025-03-04 07:27:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-03-04 07:27:55,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:55,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:55,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:55,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:55,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-03-04 07:27:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528047602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490142095] [2025-03-04 07:27:56,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:56,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:56,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:56,401 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-04 07:27:56,403 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-04 07:27:56,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:56,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:56,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:56,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:56,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 07:27:56,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:56,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:27:56,482 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-04 07:27:56,486 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-04 07:27:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:56,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490142095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:57,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-04 07:27:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760554235] [2025-03-04 07:27:57,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:57,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:27:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:57,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:27:57,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:27:57,266 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 34 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:58,122 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-03-04 07:27:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:27:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:27:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:58,122 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:27:58,122 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 07:27:58,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:27:58,124 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:58,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 07:27:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-03-04 07:27:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-04 07:27:58,125 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 19 [2025-03-04 07:27:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:58,126 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-04 07:27:58,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-04 07:27:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:27:58,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:58,126 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:58,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:27:58,327 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,SelfDestructingSolverStorable20 [2025-03-04 07:27:58,327 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:58,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 178633300, now seen corresponding path program 1 times [2025-03-04 07:27:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-04 07:27:58,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:58,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:58,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:58,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-04 07:27:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873290175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031124384] [2025-03-04 07:27:58,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:58,506 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-04 07:27:58,507 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-04 07:27:58,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:27:58,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:27:58,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:58,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:58,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:27:58,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:58,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:58,779 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-04 07:27:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:27:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031124384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:58,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-03-04 07:27:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734157462] [2025-03-04 07:27:58,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:58,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:27:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:58,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:27:58,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:27:58,799 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:58,915 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-03-04 07:27:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:27:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:27:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:58,919 INFO L225 Difference]: With dead ends: 40 [2025-03-04 07:27:58,919 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 07:27:58,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:27:58,920 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:58,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 131 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 07:27:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-04 07:27:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-04 07:27:58,921 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2025-03-04 07:27:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:58,922 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-04 07:27:58,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-04 07:27:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:27:58,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:58,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:58,934 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-04 07:27:59,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:59,126 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:27:59,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1242664967, now seen corresponding path program 1 times [2025-03-04 07:27:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-03-04 07:27:59,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:59,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:27:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:27:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-03-04 07:27:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18989616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915504958] [2025-03-04 07:27:59,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:59,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:59,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:59,409 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-04 07:27:59,410 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-04 07:27:59,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:27:59,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:27:59,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:59,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:59,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:27:59,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:59,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:27:59,475 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-04 07:27:59,478 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-04 07:27:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:59,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:28:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915504958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:00,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:00,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-04 07:28:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165099605] [2025-03-04 07:28:00,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:00,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:28:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:00,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:28:00,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:28:00,026 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 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-04 07:28:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:00,273 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-03-04 07:28:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:28:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:28:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:00,274 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:28:00,274 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:28:00,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:28:00,275 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:00,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:28:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:28:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:28:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-03-04 07:28:00,279 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 20 [2025-03-04 07:28:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-03-04 07:28:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 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-04 07:28:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-03-04 07:28:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:28:00,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:00,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:00,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:28:00,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:00,480 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:00,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -954637665, now seen corresponding path program 1 times [2025-03-04 07:28:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047887956] [2025-03-04 07:28:00,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:28:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:00,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:28:00,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:28:00,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:00,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:28:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047887956] [2025-03-04 07:28:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047887956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445899137] [2025-03-04 07:28:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:28:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:00,796 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-04 07:28:00,798 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-04 07:28:00,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:28:00,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:28:00,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:00,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 07:28:00,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:00,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:28:00,879 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-04 07:28:00,883 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-04 07:28:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:28:01,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:28:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445899137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:01,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 07:28:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163612387] [2025-03-04 07:28:01,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:01,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:28:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:01,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:28:01,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:28:01,540 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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-04 07:28:05,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:28:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:05,974 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-03-04 07:28:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:28:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:28:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:05,974 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:28:05,974 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 07:28:05,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:28:05,975 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:05,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 148 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 07:28:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 07:28:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-04 07:28:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-03-04 07:28:05,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2025-03-04 07:28:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-03-04 07:28:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 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-04 07:28:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-03-04 07:28:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:28:05,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:05,977 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:05,984 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-04 07:28:06,177 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,SelfDestructingSolverStorable23 [2025-03-04 07:28:06,178 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -954587306, now seen corresponding path program 2 times [2025-03-04 07:28:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-03-04 07:28:06,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:06,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 07:28:06,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:28:06,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:06,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586430102] [2025-03-04 07:28:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586430102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890701629] [2025-03-04 07:28:06,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:06,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:06,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:06,480 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-04 07:28:06,481 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-04 07:28:06,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 07:28:06,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:28:06,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:06,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:06,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:28:06,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:06,600 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-04 07:28:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:06,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:06,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 15 treesize of output 13 [2025-03-04 07:28:06,657 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-04 07:28:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:06,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890701629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:06,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:06,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 23 [2025-03-04 07:28:06,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047263497] [2025-03-04 07:28:06,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:06,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:28:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:06,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:28:06,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:28:06,690 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:06,790 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2025-03-04 07:28:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:28:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:28:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:06,790 INFO L225 Difference]: With dead ends: 44 [2025-03-04 07:28:06,790 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:28:06,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:28:06,791 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:06,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:28:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:28:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-04 07:28:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-03-04 07:28:06,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2025-03-04 07:28:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:06,793 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-03-04 07:28:06,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-03-04 07:28:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:28:06,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:06,793 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:06,800 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-04 07:28:06,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:06,994 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash -192741401, now seen corresponding path program 3 times [2025-03-04 07:28:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717750637] [2025-03-04 07:28:06,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:07,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 07:28:07,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:28:07,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:28:07,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717750637] [2025-03-04 07:28:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717750637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63390728] [2025-03-04 07:28:07,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:07,224 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-04 07:28:07,226 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-04 07:28:07,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-04 07:28:07,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:28:07,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:28:07,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:28:07,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:07,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:07,547 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-04 07:28:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:07,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63390728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:07,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-03-04 07:28:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167239274] [2025-03-04 07:28:07,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:07,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:28:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:07,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:28:07,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:28:07,623 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 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-04 07:28:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:07,787 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-04 07:28:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:28:07,787 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 07:28:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:07,788 INFO L225 Difference]: With dead ends: 34 [2025-03-04 07:28:07,788 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 07:28:07,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:28:07,788 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:07,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:28:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 07:28:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 07:28:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-04 07:28:07,791 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2025-03-04 07:28:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:07,791 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-04 07:28:07,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 27 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-04 07:28:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-04 07:28:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:28:07,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:07,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:07,797 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-04 07:28:07,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:07,992 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:07,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1680016172, now seen corresponding path program 2 times [2025-03-04 07:28:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:07,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802231450] [2025-03-04 07:28:07,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:07,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 07:28:08,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:28:08,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:28:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802231450] [2025-03-04 07:28:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802231450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010568247] [2025-03-04 07:28:08,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:08,409 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-04 07:28:08,411 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-04 07:28:08,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 07:28:08,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:28:08,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:08,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:08,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-04 07:28:08,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:08,518 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 07:28:08,519 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 1 case distinctions, treesize of input 13 treesize of output 11 [2025-03-04 07:28:08,526 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-04 07:28:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:28:08,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:28:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010568247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:09,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-03-04 07:28:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885001245] [2025-03-04 07:28:09,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:09,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:28:09,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:09,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:28:09,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:28:09,454 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 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-04 07:28:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:10,118 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2025-03-04 07:28:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:28:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 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 28 [2025-03-04 07:28:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:10,119 INFO L225 Difference]: With dead ends: 47 [2025-03-04 07:28:10,119 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 07:28:10,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=294, Invalid=2568, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 07:28:10,119 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:10,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:28:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 07:28:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-04 07:28:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 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-04 07:28:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-03-04 07:28:10,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2025-03-04 07:28:10,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:10,121 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-03-04 07:28:10,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 38 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-04 07:28:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-03-04 07:28:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:28:10,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:10,121 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:10,128 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-04 07:28:10,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:28:10,326 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 949511587, now seen corresponding path program 4 times [2025-03-04 07:28:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-03-04 07:28:10,326 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:10,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 07:28:10,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:28:10,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-03-04 07:28:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28837400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949458797] [2025-03-04 07:28:10,599 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:10,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:10,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:10,601 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-04 07:28:10,603 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-04 07:28:10,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-04 07:28:10,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:28:10,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:10,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 07:28:10,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:10,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:28:10,938 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 7 treesize of output 3 [2025-03-04 07:28:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:10,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:11,006 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-04 07:28:11,010 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-04 07:28:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949458797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:11,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 34 [2025-03-04 07:28:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122929172] [2025-03-04 07:28:11,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:28:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:28:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:28:11,100 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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-04 07:28:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:11,293 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-03-04 07:28:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:28:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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 32 [2025-03-04 07:28:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:11,294 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:28:11,294 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:28:11,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:28:11,294 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:11,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:28:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:28:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-04 07:28:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.108695652173913) internal successors, (51), 47 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-04 07:28:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-03-04 07:28:11,296 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 32 [2025-03-04 07:28:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:11,296 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-03-04 07:28:11,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 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-04 07:28:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-03-04 07:28:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:28:11,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:11,296 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:11,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:28:11,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 07:28:11,503 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 913055028, now seen corresponding path program 5 times [2025-03-04 07:28:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:11,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615518638] [2025-03-04 07:28:11,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:11,510 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-03-04 07:28:11,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:28:11,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:28:11,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615518638] [2025-03-04 07:28:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615518638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033140337] [2025-03-04 07:28:11,740 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:11,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:11,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:11,742 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-04 07:28:11,744 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-04 07:28:11,795 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-03-04 07:28:11,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:28:11,828 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:28:11,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:11,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:28:11,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:11,838 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-04 07:28:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:11,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033140337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:12,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2025-03-04 07:28:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134081385] [2025-03-04 07:28:12,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:28:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:12,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:28:12,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:28:12,274 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 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-04 07:28:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:12,490 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-03-04 07:28:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:28:12,490 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-04 07:28:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:12,491 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:28:12,491 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:28:12,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:28:12,491 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:12,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 100 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:28:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:28:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 07:28:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-03-04 07:28:12,493 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 35 [2025-03-04 07:28:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:12,493 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-03-04 07:28:12,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 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-04 07:28:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-03-04 07:28:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:28:12,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:12,493 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:12,500 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-04 07:28:12,693 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,SelfDestructingSolverStorable28 [2025-03-04 07:28:12,694 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1069641610, now seen corresponding path program 6 times [2025-03-04 07:28:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751560620] [2025-03-04 07:28:12,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:28:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:12,700 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-03-04 07:28:12,718 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:28:12,718 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:28:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751560620] [2025-03-04 07:28:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751560620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763734618] [2025-03-04 07:28:13,052 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:28:13,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:13,054 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-04 07:28:13,056 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-04 07:28:13,111 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 5 equivalence classes. [2025-03-04 07:28:13,169 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:28:13,169 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:28:13,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:13,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 07:28:13,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:13,259 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-04 07:28:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:13,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:13,350 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-04 07:28:13,352 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-04 07:28:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763734618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:13,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 28 [2025-03-04 07:28:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232748311] [2025-03-04 07:28:13,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:28:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:13,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:28:13,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:28:13,400 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 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-04 07:28:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:13,576 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-03-04 07:28:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:28:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 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) Word has length 40 [2025-03-04 07:28:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:13,577 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:28:13,577 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 07:28:13,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:28:13,578 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:13,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 237 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:28:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 07:28:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-04 07:28:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-03-04 07:28:13,579 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 40 [2025-03-04 07:28:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:13,579 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-03-04 07:28:13,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 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-04 07:28:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-03-04 07:28:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:28:13,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:13,579 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:13,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:28:13,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:13,780 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:13,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 556672775, now seen corresponding path program 7 times [2025-03-04 07:28:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633836351] [2025-03-04 07:28:13,781 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:13,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:13,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:28:13,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:28:13,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:13,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633836351] [2025-03-04 07:28:14,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633836351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298775123] [2025-03-04 07:28:14,129 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:14,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:14,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:14,132 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-04 07:28:14,141 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-04 07:28:14,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:28:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:28:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:14,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 07:28:14,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:14,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:14,634 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-04 07:28:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298775123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:14,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-03-04 07:28:14,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098753403] [2025-03-04 07:28:14,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:28:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:28:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:28:14,698 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:15,027 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2025-03-04 07:28:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:28:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-04 07:28:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:15,028 INFO L225 Difference]: With dead ends: 51 [2025-03-04 07:28:15,028 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:28:15,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:28:15,029 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:15,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:28:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:28:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-04 07:28:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-03-04 07:28:15,030 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 43 [2025-03-04 07:28:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-03-04 07:28:15,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 34 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-03-04 07:28:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:28:15,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:15,030 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:15,037 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-04 07:28:15,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:15,232 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:15,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 40415875, now seen corresponding path program 8 times [2025-03-04 07:28:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146025567] [2025-03-04 07:28:15,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:15,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:28:15,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:28:15,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:15,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146025567] [2025-03-04 07:28:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146025567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963116463] [2025-03-04 07:28:15,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:15,595 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-04 07:28:15,596 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-04 07:28:15,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:28:15,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:28:15,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:15,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:15,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 07:28:15,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:15,786 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-04 07:28:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:15,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:15,886 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-04 07:28:15,887 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-04 07:28:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963116463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:15,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:15,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-03-04 07:28:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972420996] [2025-03-04 07:28:15,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:28:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:15,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:28:15,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:28:15,946 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 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-04 07:28:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:16,276 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2025-03-04 07:28:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:28:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 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) Word has length 48 [2025-03-04 07:28:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:16,276 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:28:16,276 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 07:28:16,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:28:16,277 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:16,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 385 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:28:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 07:28:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-04 07:28:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 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-04 07:28:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2025-03-04 07:28:16,279 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2025-03-04 07:28:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2025-03-04 07:28:16,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 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-04 07:28:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2025-03-04 07:28:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:28:16,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:16,279 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:16,286 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-04 07:28:16,480 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,SelfDestructingSolverStorable31 [2025-03-04 07:28:16,481 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:16,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 405088276, now seen corresponding path program 9 times [2025-03-04 07:28:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709155925] [2025-03-04 07:28:16,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:16,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 6 equivalence classes. [2025-03-04 07:28:16,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:28:16,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 07:28:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709155925] [2025-03-04 07:28:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709155925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312110755] [2025-03-04 07:28:16,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:16,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:16,929 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-04 07:28:16,930 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-04 07:28:16,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 6 equivalence classes. [2025-03-04 07:28:17,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:28:17,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 07:28:17,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:17,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 07:28:17,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:17,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:17,581 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-04 07:28:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312110755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:17,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 39 [2025-03-04 07:28:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403463320] [2025-03-04 07:28:17,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:17,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:28:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:17,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:28:17,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:28:17,658 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:18,018 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-03-04 07:28:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:28:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-04 07:28:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:18,019 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:28:18,019 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:28:18,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:28:18,020 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:18,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:28:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:28:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 07:28:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 57 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-04 07:28:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2025-03-04 07:28:18,021 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 51 [2025-03-04 07:28:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:18,021 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2025-03-04 07:28:18,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2025-03-04 07:28:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:28:18,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:18,021 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:18,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:28:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:18,222 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash -327165369, now seen corresponding path program 3 times [2025-03-04 07:28:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672009144] [2025-03-04 07:28:18,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:18,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:18,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-04 07:28:18,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:28:18,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 07:28:18,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 07:28:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672009144] [2025-03-04 07:28:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672009144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87483218] [2025-03-04 07:28:18,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:18,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:18,733 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-04 07:28:18,735 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-04 07:28:18,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-04 07:28:18,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:28:18,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 07:28:18,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:18,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-04 07:28:18,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:18,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:28:18,890 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-04 07:28:18,893 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-04 07:28:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 07:28:19,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:19,995 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:28:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 07:28:19,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87483218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:19,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:19,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 49 [2025-03-04 07:28:19,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331682321] [2025-03-04 07:28:19,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:19,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 07:28:19,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:19,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 07:28:19,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:28:19,998 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:20,781 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-03-04 07:28:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:28:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-04 07:28:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:20,781 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:28:20,781 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:28:20,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=580, Invalid=4822, Unknown=0, NotChecked=0, Total=5402 [2025-03-04 07:28:20,783 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:20,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 109 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:28:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:28:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-04 07:28:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 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-04 07:28:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2025-03-04 07:28:20,784 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2025-03-04 07:28:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:20,784 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2025-03-04 07:28:20,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2025-03-04 07:28:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:28:20,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:20,785 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:20,793 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-04 07:28:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:20,985 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:20,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1730588266, now seen corresponding path program 10 times [2025-03-04 07:28:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646380307] [2025-03-04 07:28:20,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:20,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:28:21,008 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:28:21,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646380307] [2025-03-04 07:28:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646380307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950272988] [2025-03-04 07:28:21,438 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:21,441 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-04 07:28:21,443 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-04 07:28:21,516 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:28:21,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:28:21,764 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:21,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:21,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-03-04 07:28:21,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:21,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:28:22,242 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 7 treesize of output 3 [2025-03-04 07:28:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:22,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:22,333 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-04 07:28:22,334 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-04 07:28:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 17 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950272988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:22,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:22,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2025-03-04 07:28:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820050587] [2025-03-04 07:28:22,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:22,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:28:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:22,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:28:22,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2217, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:28:22,514 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 49 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 49 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:22,987 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2025-03-04 07:28:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:28:22,987 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 49 states have internal predecessors, (125), 0 states have call successors, (0), 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 56 [2025-03-04 07:28:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:22,987 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:28:22,987 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 07:28:22,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=2698, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 07:28:22,988 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:22,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 670 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:28:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 07:28:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-03-04 07:28:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 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-04 07:28:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2025-03-04 07:28:22,990 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2025-03-04 07:28:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:22,990 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2025-03-04 07:28:22,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 49 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2025-03-04 07:28:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 07:28:22,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:22,991 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:22,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 07:28:23,191 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,SelfDestructingSolverStorable34 [2025-03-04 07:28:23,191 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:23,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1947444775, now seen corresponding path program 11 times [2025-03-04 07:28:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667209179] [2025-03-04 07:28:23,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:23,200 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-03-04 07:28:23,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:28:23,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 07:28:23,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:23,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667209179] [2025-03-04 07:28:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667209179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406349865] [2025-03-04 07:28:23,622 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:23,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:23,624 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-04 07:28:23,626 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-04 07:28:23,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 7 equivalence classes. [2025-03-04 07:28:23,804 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:28:23,804 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 07:28:23,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:23,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-04 07:28:23,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:23,817 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-04 07:28:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:24,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406349865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:24,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 47 [2025-03-04 07:28:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144285459] [2025-03-04 07:28:24,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:24,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 07:28:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:24,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 07:28:24,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1976, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:28:24,522 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:24,931 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2025-03-04 07:28:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:28:24,932 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 states have internal predecessors, (141), 0 states have call successors, (0), 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-04 07:28:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:24,932 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:28:24,932 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:28:24,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2620, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 07:28:24,933 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:24,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 326 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:28:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:28:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 07:28:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.03125) internal successors, (66), 64 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-04 07:28:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-03-04 07:28:24,934 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2025-03-04 07:28:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:24,934 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-03-04 07:28:24,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.0) internal successors, (141), 48 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-03-04 07:28:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 07:28:24,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:24,935 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:24,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 07:28:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:25,139 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1531599005, now seen corresponding path program 12 times [2025-03-04 07:28:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901600420] [2025-03-04 07:28:25,140 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:28:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:25,147 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 8 equivalence classes. [2025-03-04 07:28:25,169 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:28:25,170 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 07:28:25,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 22 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:25,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901600420] [2025-03-04 07:28:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901600420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90860252] [2025-03-04 07:28:25,867 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:28:25,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:25,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:25,869 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-04 07:28:25,869 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-04 07:28:25,944 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 8 equivalence classes. [2025-03-04 07:28:26,054 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:28:26,054 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 07:28:26,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:26,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-04 07:28:26,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:26,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:28:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:26,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:26,933 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-04 07:28:26,934 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-04 07:28:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90860252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:27,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2025-03-04 07:28:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843903153] [2025-03-04 07:28:27,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:27,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 07:28:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:27,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 07:28:27,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3690, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 07:28:27,183 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 63 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 63 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:28,841 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2025-03-04 07:28:28,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 07:28:28,841 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 63 states have internal predecessors, (179), 0 states have call successors, (0), 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 64 [2025-03-04 07:28:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:28,841 INFO L225 Difference]: With dead ends: 112 [2025-03-04 07:28:28,841 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:28:28,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=677, Invalid=9223, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 07:28:28,843 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:28,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 609 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:28:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:28:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-04 07:28:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2025-03-04 07:28:28,844 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 64 [2025-03-04 07:28:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:28,845 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2025-03-04 07:28:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.8412698412698414) internal successors, (179), 63 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2025-03-04 07:28:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 07:28:28,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:28,845 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:28,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:28:29,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:29,045 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:29,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:29,046 INFO L85 PathProgramCache]: Analyzing trace with hash 207383222, now seen corresponding path program 13 times [2025-03-04 07:28:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:29,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597184336] [2025-03-04 07:28:29,046 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 07:28:29,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:28:29,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597184336] [2025-03-04 07:28:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597184336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387252032] [2025-03-04 07:28:29,619 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:29,620 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-04 07:28:29,622 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-04 07:28:29,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 07:28:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:28:29,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:29,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:29,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 07:28:29,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:29,921 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-04 07:28:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:30,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:30,061 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-04 07:28:30,062 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-04 07:28:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 23 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387252032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:30,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 40 [2025-03-04 07:28:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058641844] [2025-03-04 07:28:30,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:28:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:30,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:28:30,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:28:30,142 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:30,646 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2025-03-04 07:28:30,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:28:30,647 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-04 07:28:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:30,647 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:28:30,647 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 07:28:30,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=2017, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:28:30,647 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:30,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 678 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:28:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 07:28:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-03-04 07:28:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 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-04 07:28:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2025-03-04 07:28:30,649 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 72 [2025-03-04 07:28:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:30,649 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2025-03-04 07:28:30,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2025-03-04 07:28:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 07:28:30,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:30,649 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:30,656 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-04 07:28:30,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:30,850 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:30,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1599767225, now seen corresponding path program 14 times [2025-03-04 07:28:30,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:30,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204630680] [2025-03-04 07:28:30,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:30,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:30,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 07:28:30,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:28:30,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:30,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 51 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204630680] [2025-03-04 07:28:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204630680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116182193] [2025-03-04 07:28:31,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:31,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:31,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:31,377 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-04 07:28:31,378 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-04 07:28:31,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 07:28:31,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:28:31,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:31,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-04 07:28:31,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:31,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:32,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 5 treesize of output 3 [2025-03-04 07:28:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116182193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:32,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:32,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 49 [2025-03-04 07:28:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323122476] [2025-03-04 07:28:32,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:32,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 07:28:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:32,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 07:28:32,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2199, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:28:32,289 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 50 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 50 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-04 07:28:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:32,837 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2025-03-04 07:28:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:28:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 50 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 75 [2025-03-04 07:28:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:32,838 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:28:32,838 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:28:32,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=3081, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 07:28:32,839 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:32,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:28:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:28:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 07:28:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.025) internal successors, (82), 80 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-04 07:28:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-03-04 07:28:32,842 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2025-03-04 07:28:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:32,842 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-03-04 07:28:32,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.0816326530612246) internal successors, (151), 50 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-04 07:28:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-03-04 07:28:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:28:32,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:32,843 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:32,850 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-04 07:28:33,043 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,SelfDestructingSolverStorable38 [2025-03-04 07:28:33,043 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1018346429, now seen corresponding path program 15 times [2025-03-04 07:28:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996184446] [2025-03-04 07:28:33,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:33,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 10 equivalence classes. [2025-03-04 07:28:33,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:28:33,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 07:28:33,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:33,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:33,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996184446] [2025-03-04 07:28:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996184446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:33,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876960020] [2025-03-04 07:28:33,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:33,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:33,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:33,772 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-04 07:28:33,773 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-04 07:28:33,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 10 equivalence classes. [2025-03-04 07:28:34,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:28:34,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 07:28:34,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:34,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-04 07:28:34,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:34,730 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-04 07:28:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:34,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:34,882 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-04 07:28:34,884 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-04 07:28:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876960020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:34,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 46 [2025-03-04 07:28:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597485217] [2025-03-04 07:28:34,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 07:28:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:34,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 07:28:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1949, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 07:28:34,958 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:35,593 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2025-03-04 07:28:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:28:35,593 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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-04 07:28:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:35,594 INFO L225 Difference]: With dead ends: 133 [2025-03-04 07:28:35,594 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 07:28:35,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=2696, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 07:28:35,595 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:35,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 918 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:28:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 07:28:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-03-04 07:28:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2025-03-04 07:28:35,596 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 80 [2025-03-04 07:28:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:35,596 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2025-03-04 07:28:35,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2025-03-04 07:28:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 07:28:35,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:35,596 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:35,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 07:28:35,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 07:28:35,797 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash -920177196, now seen corresponding path program 16 times [2025-03-04 07:28:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942298019] [2025-03-04 07:28:35,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:35,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-03-04 07:28:35,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 07:28:35,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:35,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 92 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:36,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942298019] [2025-03-04 07:28:36,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942298019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889011553] [2025-03-04 07:28:36,396 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:36,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:36,398 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-04 07:28:36,399 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-04 07:28:36,496 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-03-04 07:28:36,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 07:28:36,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:36,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:36,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-04 07:28:36,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 92 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:37,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:37,507 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-04 07:28:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 92 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889011553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:37,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:37,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2025-03-04 07:28:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771075033] [2025-03-04 07:28:37,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:37,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 07:28:37,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:37,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 07:28:37,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 07:28:37,823 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 63 states, 62 states have (on average 3.193548387096774) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:38,424 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2025-03-04 07:28:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:28:38,424 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.193548387096774) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 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 83 [2025-03-04 07:28:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:38,425 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:28:38,425 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:28:38,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=557, Invalid=4699, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 07:28:38,425 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:38,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 464 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:28:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:28:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 07:28:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2025-03-04 07:28:38,427 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2025-03-04 07:28:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:38,427 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2025-03-04 07:28:38,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.193548387096774) internal successors, (198), 63 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2025-03-04 07:28:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 07:28:38,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:38,428 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:38,435 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-04 07:28:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:38,629 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:38,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1346774058, now seen corresponding path program 17 times [2025-03-04 07:28:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152990804] [2025-03-04 07:28:38,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:38,638 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 11 equivalence classes. [2025-03-04 07:28:38,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 07:28:38,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 07:28:38,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 29 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152990804] [2025-03-04 07:28:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152990804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977065216] [2025-03-04 07:28:39,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:39,415 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-04 07:28:39,416 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-04 07:28:39,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 11 equivalence classes. [2025-03-04 07:28:39,738 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 07:28:39,738 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 07:28:39,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:39,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-04 07:28:39,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:39,980 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-04 07:28:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 29 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:40,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:40,135 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-04 07:28:40,136 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-04 07:28:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 29 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977065216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:40,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 46 [2025-03-04 07:28:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092443571] [2025-03-04 07:28:40,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:40,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 07:28:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:40,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 07:28:40,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 07:28:40,210 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:40,874 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2025-03-04 07:28:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:28:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 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 88 [2025-03-04 07:28:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:40,875 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:28:40,875 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:28:40,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=2801, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 07:28:40,875 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:40,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1120 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:28:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:28:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-03-04 07:28:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 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-04 07:28:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2025-03-04 07:28:40,877 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 88 [2025-03-04 07:28:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:40,877 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2025-03-04 07:28:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.739130434782609) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2025-03-04 07:28:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 07:28:40,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:40,877 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:40,885 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-04 07:28:41,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:41,078 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash 869641319, now seen corresponding path program 18 times [2025-03-04 07:28:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924158037] [2025-03-04 07:28:41,078 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:28:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:41,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 11 equivalence classes. [2025-03-04 07:28:41,115 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 07:28:41,115 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 07:28:41,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 92 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924158037] [2025-03-04 07:28:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924158037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803864532] [2025-03-04 07:28:41,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:28:41,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:41,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:41,887 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-04 07:28:41,888 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-04 07:28:41,978 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 11 equivalence classes. [2025-03-04 07:28:43,541 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 07:28:43,541 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 07:28:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:43,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-04 07:28:43,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:43,552 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-04 07:28:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 117 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:43,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 117 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:44,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803864532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:44,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:44,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 27] total 71 [2025-03-04 07:28:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419976479] [2025-03-04 07:28:44,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:44,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-04 07:28:44,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:44,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-04 07:28:44,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=4469, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 07:28:44,684 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 72 states, 71 states have (on average 3.112676056338028) internal successors, (221), 72 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:45,425 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2025-03-04 07:28:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 07:28:45,425 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 3.112676056338028) internal successors, (221), 72 states have internal predecessors, (221), 0 states have call successors, (0), 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 91 [2025-03-04 07:28:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:45,426 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:28:45,426 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:28:45,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1126, Invalid=7246, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 07:28:45,427 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:45,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:28:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:28:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 07:28:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 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-04 07:28:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2025-03-04 07:28:45,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 91 [2025-03-04 07:28:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:45,430 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2025-03-04 07:28:45,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.112676056338028) internal successors, (221), 72 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2025-03-04 07:28:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 07:28:45,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:45,431 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:45,442 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-04 07:28:45,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:45,631 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:45,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash 410880291, now seen corresponding path program 19 times [2025-03-04 07:28:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:45,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479854377] [2025-03-04 07:28:45,632 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:45,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 07:28:45,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 07:28:45,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:45,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 32 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479854377] [2025-03-04 07:28:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479854377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501023616] [2025-03-04 07:28:46,564 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:28:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:46,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:46,565 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-04 07:28:46,567 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-04 07:28:46,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 07:28:46,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 07:28:46,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:28:46,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:46,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-04 07:28:46,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:47,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:28:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 32 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:47,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:47,208 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-04 07:28:47,209 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-04 07:28:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 32 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501023616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:47,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:47,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 49 [2025-03-04 07:28:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082956116] [2025-03-04 07:28:47,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:47,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:28:47,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:47,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:28:47,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2226, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:28:47,298 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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-04 07:28:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:48,131 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2025-03-04 07:28:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 07:28:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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 96 [2025-03-04 07:28:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:48,132 INFO L225 Difference]: With dead ends: 159 [2025-03-04 07:28:48,132 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 07:28:48,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=3241, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 07:28:48,133 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 14 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:48,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1265 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:28:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 07:28:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-04 07:28:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.02020202020202) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-03-04 07:28:48,135 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 96 [2025-03-04 07:28:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:48,135 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-03-04 07:28:48,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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-04 07:28:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2025-03-04 07:28:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 07:28:48,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:48,135 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:48,143 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-04 07:28:48,336 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,SelfDestructingSolverStorable43 [2025-03-04 07:28:48,336 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:48,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -427018060, now seen corresponding path program 20 times [2025-03-04 07:28:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:48,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046919848] [2025-03-04 07:28:48,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:48,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 07:28:48,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 07:28:48,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 117 proven. 356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046919848] [2025-03-04 07:28:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046919848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498875263] [2025-03-04 07:28:49,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:28:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:49,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:49,107 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-04 07:28:49,107 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-04 07:28:49,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 07:28:49,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 07:28:49,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:28:49,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:49,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-04 07:28:49,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 145 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:49,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:50,132 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-04 07:28:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 145 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498875263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:50,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 61 [2025-03-04 07:28:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390173203] [2025-03-04 07:28:50,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 07:28:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 07:28:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3390, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 07:28:50,341 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 62 states, 61 states have (on average 3.262295081967213) internal successors, (199), 62 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-04 07:28:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:51,160 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2025-03-04 07:28:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 07:28:51,160 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.262295081967213) internal successors, (199), 62 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) Word has length 99 [2025-03-04 07:28:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:51,161 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:28:51,161 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:28:51,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 153 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=530, Invalid=4872, Unknown=0, NotChecked=0, Total=5402 [2025-03-04 07:28:51,161 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:51,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 701 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:28:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:28:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 07:28:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2025-03-04 07:28:51,163 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 99 [2025-03-04 07:28:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:51,163 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2025-03-04 07:28:51,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.262295081967213) internal successors, (199), 62 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-04 07:28:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2025-03-04 07:28:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 07:28:51,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:51,163 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:51,170 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-04 07:28:51,368 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,SelfDestructingSolverStorable44 [2025-03-04 07:28:51,368 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:51,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 291742966, now seen corresponding path program 21 times [2025-03-04 07:28:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422160364] [2025-03-04 07:28:51,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:51,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 13 equivalence classes. [2025-03-04 07:28:51,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 07:28:51,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-04 07:28:51,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 35 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422160364] [2025-03-04 07:28:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422160364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133158980] [2025-03-04 07:28:52,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:28:52,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:52,392 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-04 07:28:52,398 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-04 07:28:52,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 13 equivalence classes. [2025-03-04 07:28:54,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 07:28:54,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-04 07:28:54,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:54,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 197 conjuncts are in the unsatisfiable core [2025-03-04 07:28:54,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:54,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:28:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 35 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:55,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:55,631 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-04 07:28:55,632 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-04 07:28:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 35 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:56,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133158980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:56,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:56,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 32] total 81 [2025-03-04 07:28:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596595033] [2025-03-04 07:28:56,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-03-04 07:28:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:56,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-03-04 07:28:56,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=6241, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 07:28:56,081 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 81 states, 81 states have (on average 3.0) internal successors, (243), 81 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:57,277 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2025-03-04 07:28:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 07:28:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.0) internal successors, (243), 81 states have internal predecessors, (243), 0 states have call successors, (0), 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-04 07:28:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:57,277 INFO L225 Difference]: With dead ends: 172 [2025-03-04 07:28:57,277 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 07:28:57,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=314, Invalid=8428, Unknown=0, NotChecked=0, Total=8742 [2025-03-04 07:28:57,278 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 3400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:57,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1871 Invalid, 3400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:28:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 07:28:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-03-04 07:28:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2025-03-04 07:28:57,280 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 104 [2025-03-04 07:28:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2025-03-04 07:28:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.0) internal successors, (243), 81 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:28:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2025-03-04 07:28:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 07:28:57,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:57,280 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:57,291 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-04 07:28:57,480 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,SelfDestructingSolverStorable45 [2025-03-04 07:28:57,481 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:28:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1273613433, now seen corresponding path program 22 times [2025-03-04 07:28:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883706182] [2025-03-04 07:28:57,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:28:57,493 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 107 statements into 2 equivalence classes. [2025-03-04 07:28:57,508 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 07:28:57,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 176 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:58,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:28:58,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883706182] [2025-03-04 07:28:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883706182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:28:58,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901671842] [2025-03-04 07:28:58,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:28:58,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:28:58,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:28:58,277 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-04 07:28:58,278 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-04 07:28:58,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 107 statements into 2 equivalence classes. [2025-03-04 07:28:58,769 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 07:28:58,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:28:58,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:28:58,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-04 07:28:58,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:28:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 176 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:28:59,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:59,938 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-04 07:29:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 176 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901671842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:00,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:00,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 77 [2025-03-04 07:29:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954349856] [2025-03-04 07:29:00,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:00,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-04 07:29:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:00,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-04 07:29:00,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=5306, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 07:29:00,406 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 78 states, 77 states have (on average 3.311688311688312) internal successors, (255), 78 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:01,311 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2025-03-04 07:29:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 07:29:01,311 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 3.311688311688312) internal successors, (255), 78 states have internal predecessors, (255), 0 states have call successors, (0), 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 107 [2025-03-04 07:29:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:01,312 INFO L225 Difference]: With dead ends: 113 [2025-03-04 07:29:01,312 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 07:29:01,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=869, Invalid=7321, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 07:29:01,312 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:01,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 762 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:29:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 07:29:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 07:29:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2025-03-04 07:29:01,314 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 107 [2025-03-04 07:29:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2025-03-04 07:29:01,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 3.311688311688312) internal successors, (255), 78 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2025-03-04 07:29:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 07:29:01,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:01,315 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:01,324 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-04 07:29:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:01,515 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:29:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1427404291, now seen corresponding path program 23 times [2025-03-04 07:29:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081090508] [2025-03-04 07:29:01,516 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:29:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:01,527 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 14 equivalence classes. [2025-03-04 07:29:01,572 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 07:29:01,572 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 07:29:01,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 38 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:02,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:02,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081090508] [2025-03-04 07:29:02,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081090508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:02,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198018823] [2025-03-04 07:29:02,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:29:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:02,543 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-04 07:29:02,544 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-04 07:29:02,655 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 14 equivalence classes. [2025-03-04 07:29:07,311 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 07:29:07,311 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 07:29:07,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:07,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 146 conjuncts are in the unsatisfiable core [2025-03-04 07:29:07,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:07,377 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-04 07:29:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 38 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:07,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:07,496 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-04 07:29:07,498 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-04 07:29:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 38 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198018823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:07,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34, 34] total 39 [2025-03-04 07:29:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372749377] [2025-03-04 07:29:07,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:07,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:29:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:07,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:29:07,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:29:07,589 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 39 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:08,391 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2025-03-04 07:29:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 07:29:08,392 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 39 states have internal predecessors, (123), 0 states have call successors, (0), 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 112 [2025-03-04 07:29:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:08,392 INFO L225 Difference]: With dead ends: 185 [2025-03-04 07:29:08,392 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 07:29:08,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=2317, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:29:08,393 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:08,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1312 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:29:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 07:29:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-04 07:29:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.017391304347826) internal successors, (117), 115 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2025-03-04 07:29:08,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 112 [2025-03-04 07:29:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:08,394 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2025-03-04 07:29:08,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.1538461538461537) internal successors, (123), 39 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2025-03-04 07:29:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 07:29:08,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:08,395 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:08,408 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-04 07:29:08,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 07:29:08,595 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:29:08,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 370926484, now seen corresponding path program 24 times [2025-03-04 07:29:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:08,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51791383] [2025-03-04 07:29:08,596 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:29:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:08,607 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 115 statements into 14 equivalence classes. [2025-03-04 07:29:08,646 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 07:29:08,647 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-04 07:29:08,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 176 proven. 487 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51791383] [2025-03-04 07:29:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51791383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106939786] [2025-03-04 07:29:09,793 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:29:09,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:09,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:09,795 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-04 07:29:09,796 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-04 07:29:09,920 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 115 statements into 14 equivalence classes. [2025-03-04 07:29:13,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 07:29:13,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-04 07:29:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:13,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-03-04 07:29:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 210 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:14,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:14,735 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-04 07:29:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 210 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106939786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:15,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33, 33] total 74 [2025-03-04 07:29:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797447800] [2025-03-04 07:29:15,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:15,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-03-04 07:29:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:15,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-03-04 07:29:15,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=4787, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 07:29:15,005 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand has 75 states, 74 states have (on average 3.2567567567567566) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:15,952 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2025-03-04 07:29:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 07:29:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 3.2567567567567566) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 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 115 [2025-03-04 07:29:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:15,953 INFO L225 Difference]: With dead ends: 121 [2025-03-04 07:29:15,953 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 07:29:15,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 179 SyntacticMatches, 14 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1513, Invalid=8587, Unknown=0, NotChecked=0, Total=10100 [2025-03-04 07:29:15,954 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:15,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 189 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:29:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 07:29:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 07:29:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2025-03-04 07:29:15,956 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 115 [2025-03-04 07:29:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:15,956 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2025-03-04 07:29:15,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 3.2567567567567566) internal successors, (241), 75 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2025-03-04 07:29:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 07:29:15,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:15,956 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:15,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:16,157 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,SelfDestructingSolverStorable48 [2025-03-04 07:29:16,157 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:29:16,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -649345514, now seen corresponding path program 25 times [2025-03-04 07:29:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41344574] [2025-03-04 07:29:16,157 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:29:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:16,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 07:29:16,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 07:29:16,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:16,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 41 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41344574] [2025-03-04 07:29:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41344574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533729102] [2025-03-04 07:29:17,336 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:29:17,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:17,338 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:29:17,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 07:29:17,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 07:29:17,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 07:29:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:17,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 156 conjuncts are in the unsatisfiable core [2025-03-04 07:29:17,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:17,916 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-04 07:29:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 41 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:18,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:18,125 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-04 07:29:18,126 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-04 07:29:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 41 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533729102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:18,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:18,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 58 [2025-03-04 07:29:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676118560] [2025-03-04 07:29:18,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:18,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 07:29:18,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:18,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 07:29:18,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=3159, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 07:29:18,221 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 2.9310344827586206) internal successors, (170), 58 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:19,431 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2025-03-04 07:29:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 07:29:19,431 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.9310344827586206) internal successors, (170), 58 states have internal predecessors, (170), 0 states have call successors, (0), 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 120 [2025-03-04 07:29:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:19,432 INFO L225 Difference]: With dead ends: 198 [2025-03-04 07:29:19,432 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:29:19,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=217, Invalid=4753, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 07:29:19,432 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 3439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:19,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1966 Invalid, 3439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:29:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:29:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-03-04 07:29:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.016260162601626) internal successors, (125), 123 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2025-03-04 07:29:19,434 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 120 [2025-03-04 07:29:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:19,434 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2025-03-04 07:29:19,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.9310344827586206) internal successors, (170), 58 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2025-03-04 07:29:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 07:29:19,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:19,435 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:19,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 07:29:19,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-04 07:29:19,636 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-04 07:29:19,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1051127129, now seen corresponding path program 26 times [2025-03-04 07:29:19,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17311968] [2025-03-04 07:29:19,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:19,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-04 07:29:19,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 07:29:19,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat