./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrspn-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/cstrspn-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 45a8f33f173b19ce98ca13bb7c3a70605cebce85501309e729b51c966620adf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:26:35,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:26:35,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:26:35,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:26:35,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:26:35,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:26:35,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:26:35,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:26:35,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:26:35,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:26:35,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:26:35,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:26:35,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:26:35,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:26:35,440 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:26:35,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:26:35,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:26:35,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:26:35,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:26:35,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:26:35,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:26:35,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:26:35,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:26:35,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:26:35,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:26:35,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:26:35,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:26:35,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:26:35,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:26:35,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:26:35,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:26:35,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:26:35,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:26:35,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:26:35,444 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 -> 45a8f33f173b19ce98ca13bb7c3a70605cebce85501309e729b51c966620adf7 [2025-03-04 07:26:35,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:26:35,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:26:35,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:26:35,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:26:35,671 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:26:35,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2025-03-04 07:26:36,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ccd85d93/2875dd4b73ea45cd80395839c061739a/FLAG567e9f9dd [2025-03-04 07:26:37,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:26:37,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2025-03-04 07:26:37,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ccd85d93/2875dd4b73ea45cd80395839c061739a/FLAG567e9f9dd [2025-03-04 07:26:37,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ccd85d93/2875dd4b73ea45cd80395839c061739a [2025-03-04 07:26:37,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:26:37,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:26:37,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:26:37,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:26:37,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:26:37,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37, skipping insertion in model container [2025-03-04 07:26:37,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:26:37,279 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:26:37,280 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:26:37,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:26:37,294 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:26:37,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:26:37,353 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:26:37,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37 WrapperNode [2025-03-04 07:26:37,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:26:37,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:26:37,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:26:37,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:26:37,360 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:26:37" (1/1) ... [2025-03-04 07:26:37,370 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:26:37" (1/1) ... [2025-03-04 07:26:37,387 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-03-04 07:26:37,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:26:37,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:26:37,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:26:37,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:26:37,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,409 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-04 07:26:37,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:26:37,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:26:37,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:26:37,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:26:37,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (1/1) ... [2025-03-04 07:26:37,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:26:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:37,448 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:26:37,450 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:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:26:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:26:37,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:26:37,547 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:26:37,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:26:37,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_#t~ret18#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-03-04 07:26:37,737 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-04 07:26:37,738 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:26:37,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:26:37,745 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:26:37,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:37 BoogieIcfgContainer [2025-03-04 07:26:37,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:26:37,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:26:37,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:26:37,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:26:37,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:26:37" (1/3) ... [2025-03-04 07:26:37,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9fc022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:26:37, skipping insertion in model container [2025-03-04 07:26:37,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:37" (2/3) ... [2025-03-04 07:26:37,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9fc022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:26:37, skipping insertion in model container [2025-03-04 07:26:37,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:37" (3/3) ... [2025-03-04 07:26:37,752 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca-1.i [2025-03-04 07:26:37,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:26:37,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrspn-alloca-1.i that has 1 procedures, 50 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-03-04 07:26:37,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:26:37,793 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;@31a9f491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:26:37,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 07:26:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:26:37,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:37,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:37,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:37,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:37,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1268415587, now seen corresponding path program 1 times [2025-03-04 07:26:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-03-04 07:26:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:37,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:26:37,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:26:37,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:37,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:37,986 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:26:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-03-04 07:26:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438087861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361304329] [2025-03-04 07:26:37,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:38,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:38,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:38,012 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:26:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:38,058 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-03-04 07:26:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:38,061 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:26:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:38,065 INFO L225 Difference]: With dead ends: 60 [2025-03-04 07:26:38,065 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:26:38,066 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:26:38,069 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:38,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:26:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-03-04 07:26:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.84375) internal successors, (59), 50 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:26:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-04 07:26:38,095 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 7 [2025-03-04 07:26:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:38,095 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-04 07:26:38,095 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:26:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-04 07:26:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:26:38,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:38,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:38,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:26:38,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1267492066, now seen corresponding path program 1 times [2025-03-04 07:26:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:38,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-03-04 07:26:38,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:38,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:26:38,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:26:38,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:38,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:38,221 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:26:38,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556513232] [2025-03-04 07:26:38,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556513232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:38,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:38,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:26:38,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672354681] [2025-03-04 07:26:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:38,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:38,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:38,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:38,223 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:38,269 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-04 07:26:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:38,270 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:26:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:38,270 INFO L225 Difference]: With dead ends: 49 [2025-03-04 07:26:38,270 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 07:26:38,271 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:26:38,272 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:38,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 07:26:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 07:26:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.78125) 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:26:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-04 07:26:38,277 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 7 [2025-03-04 07:26:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:38,278 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-04 07:26:38,278 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:26:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-04 07:26:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:26:38,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:38,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:38,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:26:38,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1267492065, now seen corresponding path program 1 times [2025-03-04 07:26:38,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:38,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 07:26:38,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:38,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:26:38,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:26:38,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:38,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:38,509 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:26:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 07:26:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186422006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837279440] [2025-03-04 07:26:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:38,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:38,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:38,510 INFO L87 Difference]: Start difference. First operand 49 states and 57 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:26:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:38,584 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-03-04 07:26:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:38,585 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:26:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:38,586 INFO L225 Difference]: With dead ends: 52 [2025-03-04 07:26:38,586 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 07:26:38,587 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:26:38,587 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:38,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 111 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 07:26:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-04 07:26:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 50 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:26:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-03-04 07:26:38,592 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 7 [2025-03-04 07:26:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-03-04 07:26:38,592 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:26:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-03-04 07:26:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:26:38,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:38,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:38,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:26:38,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -666182569, now seen corresponding path program 1 times [2025-03-04 07:26:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080759684] [2025-03-04 07:26:38,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:26:38,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:26:38,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:38,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:38,712 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:26:38,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:38,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080759684] [2025-03-04 07:26:38,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080759684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:26:38,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564993150] [2025-03-04 07:26:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:38,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:38,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:38,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:38,713 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:38,733 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2025-03-04 07:26:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:26:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:38,734 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:26:38,734 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:26:38,734 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:26:38,735 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:38,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 95 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:26:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-03-04 07:26:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.763157894736842) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:26:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-04 07:26:38,737 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 8 [2025-03-04 07:26:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-04 07:26:38,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-04 07:26:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:26:38,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:38,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:38,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:26:38,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:38,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:38,745 INFO L85 PathProgramCache]: Analyzing trace with hash -666182410, now seen corresponding path program 1 times [2025-03-04 07:26:38,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:38,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-03-04 07:26:38,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:38,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:26:38,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:26:38,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:38,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:38,777 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:26:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-03-04 07:26:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64727775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630937135] [2025-03-04 07:26:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:38,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:38,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:38,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:38,778 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:38,799 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-03-04 07:26:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:26:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:38,801 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:26:38,801 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 07:26:38,802 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:26:38,802 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:38,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 07:26:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-04 07:26:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:26:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-03-04 07:26:38,807 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 8 [2025-03-04 07:26:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:38,808 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-03-04 07:26:38,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-03-04 07:26:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:26:38,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:38,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:38,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:26:38,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -665258889, now seen corresponding path program 1 times [2025-03-04 07:26:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955058855] [2025-03-04 07:26:38,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:38,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:26:38,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:26:38,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:38,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955058855] [2025-03-04 07:26:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955058855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:38,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:38,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774416028] [2025-03-04 07:26:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:38,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:38,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:38,944 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:39,010 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2025-03-04 07:26:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:39,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:26:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:39,010 INFO L225 Difference]: With dead ends: 64 [2025-03-04 07:26:39,010 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 07:26:39,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:26:39,011 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 124 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:39,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 124 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 07:26:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-04 07:26:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 62 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:26:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-03-04 07:26:39,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 8 [2025-03-04 07:26:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:39,019 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-03-04 07:26:39,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-03-04 07:26:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:26:39,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:39,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:39,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:26:39,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -665258888, now seen corresponding path program 1 times [2025-03-04 07:26:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540965812] [2025-03-04 07:26:39,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:39,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:26:39,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:26:39,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:39,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:39,168 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:26:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540965812] [2025-03-04 07:26:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540965812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:39,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:26:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601647517] [2025-03-04 07:26:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:39,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:26:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:39,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:26:39,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:26:39,170 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:39,245 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-03-04 07:26:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:26:39,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:26:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:39,246 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:26:39,246 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:26:39,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:39,247 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:39,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 138 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:26:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 07:26:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 66 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-03-04 07:26:39,252 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 8 [2025-03-04 07:26:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:39,252 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-03-04 07:26:39,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-03-04 07:26:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:26:39,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:39,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:39,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:26:39,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:39,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash -637553418, now seen corresponding path program 1 times [2025-03-04 07:26:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:39,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014518153] [2025-03-04 07:26:39,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:26:39,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:26:39,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:39,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:39,360 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:26:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014518153] [2025-03-04 07:26:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014518153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888205672] [2025-03-04 07:26:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:39,361 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:39,406 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2025-03-04 07:26:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:26:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:39,408 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:26:39,408 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:26:39,409 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:26:39,409 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 105 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:26:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-03-04 07:26:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 66 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-03-04 07:26:39,414 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 8 [2025-03-04 07:26:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-03-04 07:26:39,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-03-04 07:26:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:26:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:39,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:39,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:26:39,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 823176824, now seen corresponding path program 1 times [2025-03-04 07:26:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:39,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384393050] [2025-03-04 07:26:39,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:39,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:39,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:39,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:39,497 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:26:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384393050] [2025-03-04 07:26:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384393050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:26:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909702030] [2025-03-04 07:26:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:39,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:39,498 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:39,520 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2025-03-04 07:26:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:26:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:39,521 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:26:39,521 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 07:26:39,521 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:26:39,521 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:39,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 07:26:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-04 07:26:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 69 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:26:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-04 07:26:39,526 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 9 [2025-03-04 07:26:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:39,526 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-04 07:26:39,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-04 07:26:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:26:39,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:39,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:39,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:26:39,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 851805975, now seen corresponding path program 1 times [2025-03-04 07:26:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-03-04 07:26:39,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:39,617 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:26:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-03-04 07:26:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923784749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830499040] [2025-03-04 07:26:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:39,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:39,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:39,619 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:39,637 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-04 07:26:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:26:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:39,638 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:26:39,638 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:26:39,638 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:26:39,638 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:39,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:26:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-03-04 07:26:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-04 07:26:39,641 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 9 [2025-03-04 07:26:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:39,641 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-04 07:26:39,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-04 07:26:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:26:39,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:39,642 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:39,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:26:39,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1496354170, now seen corresponding path program 1 times [2025-03-04 07:26:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029992708] [2025-03-04 07:26:39,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:39,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:26:39,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:26:39,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:39,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:39,854 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:26:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029992708] [2025-03-04 07:26:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029992708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10118429] [2025-03-04 07:26:39,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:39,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:39,857 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:26:39,859 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:26:39,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:26:39,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:26:39,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:39,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:26:39,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:26:39,986 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:26:39,994 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:26:40,120 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:26:40,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:40,241 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:26:40,254 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:26:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10118429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:40,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-04 07:26:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6726930] [2025-03-04 07:26:40,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:40,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:26:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:40,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:26:40,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:26:40,256 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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:26:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:40,446 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-04 07:26:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:40,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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:26:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:40,447 INFO L225 Difference]: With dead ends: 69 [2025-03-04 07:26:40,447 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:26:40,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:26:40,448 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:40,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 279 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:26:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-04 07:26:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.56) internal successors, (78), 62 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-03-04 07:26:40,454 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 10 [2025-03-04 07:26:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:40,454 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-03-04 07:26:40,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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:26:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-03-04 07:26:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:26:40,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:40,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:40,462 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:26:40,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 07:26:40,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:40,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 798944819, now seen corresponding path program 1 times [2025-03-04 07:26:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:40,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107765182] [2025-03-04 07:26:40,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:40,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:40,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:40,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:40,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:40,689 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:26:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107765182] [2025-03-04 07:26:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107765182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:40,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:26:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670902545] [2025-03-04 07:26:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:40,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:40,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:40,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:40,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:40,690 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:26:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:40,724 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-03-04 07:26:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:26:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:40,725 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:26:40,725 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:26:40,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:40,726 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:40,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:26:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 07:26:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.52) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-04 07:26:40,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 11 [2025-03-04 07:26:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:40,728 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-04 07:26:40,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:26:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-04 07:26:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:26:40,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:40,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:40,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:26:40,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:40,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash 798944820, now seen corresponding path program 1 times [2025-03-04 07:26:40,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:40,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-03-04 07:26:40,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:40,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:40,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:40,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:40,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:40,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:40,833 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:26:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-03-04 07:26:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752789115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:40,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:40,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:26:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593885462] [2025-03-04 07:26:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:26:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:40,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:26:40,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:26:40,834 INFO L87 Difference]: Start difference. First operand 61 states and 76 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:26:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:40,906 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2025-03-04 07:26:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:26:40,906 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:26:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:40,906 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:26:40,906 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:26:40,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:40,907 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:40,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 98 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:26:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-03-04 07:26:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.509433962264151) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:26:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-04 07:26:40,909 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2025-03-04 07:26:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:40,909 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 07:26:40,909 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:26:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-04 07:26:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:26:40,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:40,912 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:40,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:26:40,912 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:40,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1748438469, now seen corresponding path program 1 times [2025-03-04 07:26:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:40,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293046752] [2025-03-04 07:26:40,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:40,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:40,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:40,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:40,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:41,069 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:26:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293046752] [2025-03-04 07:26:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293046752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470775444] [2025-03-04 07:26:41,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:41,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:41,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:41,072 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:26:41,073 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:26:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:41,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:41,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:41,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:41,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:26:41,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-04 07:26:41,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:26:41,253 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:26:41,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:41,369 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:26:41,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470775444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:41,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:41,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 07:26:41,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267459783] [2025-03-04 07:26:41,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:41,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:26:41,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:41,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:26:41,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:26:41,370 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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:26:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:41,502 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2025-03-04 07:26:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:26:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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) Word has length 11 [2025-03-04 07:26:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:41,503 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:26:41,503 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:26:41,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:26:41,504 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:41,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 128 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:26:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2025-03-04 07:26:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.469387755102041) internal successors, (72), 58 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2025-03-04 07:26:41,505 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 11 [2025-03-04 07:26:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:41,505 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2025-03-04 07:26:41,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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:26:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2025-03-04 07:26:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:26:41,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:41,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:41,514 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:26:41,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 07:26:41,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -857666053, now seen corresponding path program 1 times [2025-03-04 07:26:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:41,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-04 07:26:41,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:41,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:41,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:41,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103184797] [2025-03-04 07:26:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103184797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:26:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894885283] [2025-03-04 07:26:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:26:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:41,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:26:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:41,824 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:26:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:41,852 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-03-04 07:26:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:26:41,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:26:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:41,853 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:26:41,853 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:26:41,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:41,853 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:41,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:26:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-03-04 07:26:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 50 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:26:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-04 07:26:41,855 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 11 [2025-03-04 07:26:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-04 07:26:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:26:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-04 07:26:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:26:41,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:41,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:26:41,856 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:41,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1296628113, now seen corresponding path program 1 times [2025-03-04 07:26:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336056483] [2025-03-04 07:26:41,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:41,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:26:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:26:41,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:41,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:41,975 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:26:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336056483] [2025-03-04 07:26:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336056483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:26:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006121309] [2025-03-04 07:26:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:41,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:41,977 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:41,997 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-04 07:26:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:41,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:26:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:41,998 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:26:41,998 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 07:26:41,998 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:26:41,998 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:41,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 07:26:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 07:26:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-04 07:26:42,000 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 15 [2025-03-04 07:26:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,000 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-04 07:26:42,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-04 07:26:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:26:42,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:26:42,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1296682761, now seen corresponding path program 1 times [2025-03-04 07:26:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553661428] [2025-03-04 07:26:42,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:26:42,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:26:42,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,034 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:26:42,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553661428] [2025-03-04 07:26:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553661428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049452871] [2025-03-04 07:26:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:42,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:42,035 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:42,069 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-04 07:26:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:26:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:42,070 INFO L225 Difference]: With dead ends: 44 [2025-03-04 07:26:42,070 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 07:26:42,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:26:42,070 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:42,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 57 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 07:26:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 07:26:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 43 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:26:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-04 07:26:42,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 15 [2025-03-04 07:26:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,072 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-04 07:26:42,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-04 07:26:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:26:42,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:42,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:26:42,073 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1296682762, now seen corresponding path program 1 times [2025-03-04 07:26:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-04 07:26:42,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:26:42,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:26:42,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,188 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:26:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-03-04 07:26:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307157604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:26:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544295376] [2025-03-04 07:26:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:26:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:26:42,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:42,189 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:42,265 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-04 07:26:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:26:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:42,266 INFO L225 Difference]: With dead ends: 55 [2025-03-04 07:26:42,266 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 07:26:42,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:26:42,266 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:42,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 07:26:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-03-04 07:26:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.326086956521739) internal successors, (61), 50 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:26:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-04 07:26:42,268 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 15 [2025-03-04 07:26:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,268 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-04 07:26:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:26:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-04 07:26:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:26:42,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,268 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:26:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:26:42,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash -431569743, now seen corresponding path program 1 times [2025-03-04 07:26:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984974326] [2025-03-04 07:26:42,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:26:42,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:26:42,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984974326] [2025-03-04 07:26:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984974326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:26:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016702138] [2025-03-04 07:26:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:42,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:42,290 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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:26:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:42,298 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-04 07:26:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:42,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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:26:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:42,299 INFO L225 Difference]: With dead ends: 53 [2025-03-04 07:26:42,299 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 07:26:42,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:42,299 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:42,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 07:26:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 07:26:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) 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:26:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-04 07:26:42,300 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 19 [2025-03-04 07:26:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,300 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 07:26:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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:26:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-04 07:26:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:26:42,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:26:42,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1872432687, now seen corresponding path program 1 times [2025-03-04 07:26:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624666802] [2025-03-04 07:26:42,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:26:42,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:26:42,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:42,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624666802] [2025-03-04 07:26:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624666802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:26:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571207836] [2025-03-04 07:26:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:26:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:26:42,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:42,440 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:42,469 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-04 07:26:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:26:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:26:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:42,470 INFO L225 Difference]: With dead ends: 62 [2025-03-04 07:26:42,470 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:26:42,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:26:42,471 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:26:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 07:26:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) 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:26:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-04 07:26:42,472 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 21 [2025-03-04 07:26:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,473 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-04 07:26:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-04 07:26:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:26:42,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:42,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:26:42,473 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1027960816, now seen corresponding path program 1 times [2025-03-04 07:26:42,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151460879] [2025-03-04 07:26:42,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:26:42,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:26:42,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:42,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151460879] [2025-03-04 07:26:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151460879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:26:42,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733854955] [2025-03-04 07:26:42,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:26:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:26:42,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:26:42,587 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:42,628 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2025-03-04 07:26:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:26:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:42,629 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:26:42,629 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 07:26:42,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:26:42,630 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:42,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 157 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 07:26:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2025-03-04 07:26:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-03-04 07:26:42,631 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 21 [2025-03-04 07:26:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,631 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-04 07:26:42,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-03-04 07:26:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:26:42,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:42,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:26:42,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1148299019, now seen corresponding path program 1 times [2025-03-04 07:26:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-03-04 07:26:42,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:26:42,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:26:42,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-03-04 07:26:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438235071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:26:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846804341] [2025-03-04 07:26:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:26:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:26:42,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:26:42,778 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:42,848 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-03-04 07:26:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:26:42,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:26:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:42,848 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:26:42,848 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:26:42,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:26:42,850 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:42,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:26:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-04 07:26:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2025-03-04 07:26:42,851 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 24 [2025-03-04 07:26:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:42,851 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-03-04 07:26:42,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2025-03-04 07:26:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:26:42,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:42,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:42,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:26:42,852 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1149126235, now seen corresponding path program 1 times [2025-03-04 07:26:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:42,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-04 07:26:42,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:42,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:26:42,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:26:42,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-04 07:26:42,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:42,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:26:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-03-04 07:26:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:26:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:42,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:26:42,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:26:42,931 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:43,017 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2025-03-04 07:26:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:26:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:26:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:43,018 INFO L225 Difference]: With dead ends: 66 [2025-03-04 07:26:43,018 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 07:26:43,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:26:43,018 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:43,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 141 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 07:26:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 07:26:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-04 07:26:43,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 24 [2025-03-04 07:26:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:43,020 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-04 07:26:43,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-04 07:26:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:26:43,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:43,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:43,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:26:43,020 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1359649932, now seen corresponding path program 1 times [2025-03-04 07:26:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643021385] [2025-03-04 07:26:43,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:26:43,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:26:43,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643021385] [2025-03-04 07:26:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643021385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:43,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:26:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495193140] [2025-03-04 07:26:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:43,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:26:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:43,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:26:43,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:26:43,169 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:43,238 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-03-04 07:26:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:26:43,238 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 07:26:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:43,239 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:26:43,239 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 07:26:43,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:26:43,239 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:43,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 07:26:43,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-04 07:26:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 44 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:26:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-04 07:26:43,240 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2025-03-04 07:26:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-04 07:26:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-04 07:26:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:26:43,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:43,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:26:43,241 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1516262803, now seen corresponding path program 1 times [2025-03-04 07:26:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24258756] [2025-03-04 07:26:43,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:43,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:26:43,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:26:43,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24258756] [2025-03-04 07:26:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24258756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:43,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751492715] [2025-03-04 07:26:43,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:43,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:43,442 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:26:43,443 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:26:43,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:26:43,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:26:43,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:43,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:43,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:26:43,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:43,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:43,700 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:26:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751492715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:43,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:43,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-04 07:26:43,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678513053] [2025-03-04 07:26:43,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:43,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:26:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:43,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:26:43,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:26:43,761 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:43,901 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-03-04 07:26:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:26:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 07:26:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:43,902 INFO L225 Difference]: With dead ends: 54 [2025-03-04 07:26:43,902 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:26:43,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:26:43,903 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:43,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 124 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:26:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2025-03-04 07:26:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 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:26:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-04 07:26:43,904 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2025-03-04 07:26:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:43,904 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-04 07:26:43,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-04 07:26:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:26:43,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:43,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:43,911 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:26:44,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:44,105 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:44,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1134685125, now seen corresponding path program 1 times [2025-03-04 07:26:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634328048] [2025-03-04 07:26:44,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:44,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:44,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:26:44,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:26:44,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:44,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:44,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634328048] [2025-03-04 07:26:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634328048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:44,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625326289] [2025-03-04 07:26:44,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:44,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:44,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:44,215 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:26:44,217 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:26:44,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:26:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:26:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:44,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:26:44,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:44,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:44,447 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:26:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625326289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:44,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 07:26:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253107391] [2025-03-04 07:26:44,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:26:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:44,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:26:44,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:26:44,467 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 17 states, 16 states have (on average 4.3125) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:44,561 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-04 07:26:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:26:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.3125) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-04 07:26:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:44,562 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:26:44,562 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:26:44,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:26:44,563 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:44,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 162 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:26:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2025-03-04 07:26:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-04 07:26:44,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 29 [2025-03-04 07:26:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:44,566 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-04 07:26:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.3125) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-04 07:26:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:26:44,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:44,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:44,572 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:26:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:26:44,767 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -571894958, now seen corresponding path program 2 times [2025-03-04 07:26:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-03-04 07:26:44,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:44,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 07:26:44,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:26:44,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:26:44,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:45,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-03-04 07:26:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372185404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973382743] [2025-03-04 07:26:45,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:45,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:45,056 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:26:45,057 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:26:45,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 07:26:45,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:26:45,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:26:45,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:45,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:26:45,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:45,169 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:26:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:45,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:45,266 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:26:45,267 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:26:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973382743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:45,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 26 [2025-03-04 07:26:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205541638] [2025-03-04 07:26:45,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:26:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:45,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:26:45,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:26:45,315 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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:26:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:45,496 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-04 07:26:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:26:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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 33 [2025-03-04 07:26:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:45,497 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:26:45,497 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:26:45,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:26:45,497 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:45,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 295 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:26:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-03-04 07:26:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.127906976744186) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:26:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2025-03-04 07:26:45,499 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 33 [2025-03-04 07:26:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2025-03-04 07:26:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 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:26:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2025-03-04 07:26:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:26:45,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:45,500 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:45,506 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:26:45,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:26:45,704 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1346343569, now seen corresponding path program 3 times [2025-03-04 07:26:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029497643] [2025-03-04 07:26:45,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:26:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:45,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-04 07:26:45,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:26:45,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:26:45,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029497643] [2025-03-04 07:26:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029497643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174974952] [2025-03-04 07:26:45,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:26:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:45,903 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:26:45,905 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:26:45,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-04 07:26:45,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:26:45,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:26:45,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:45,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:26:45,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:46,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:46,201 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:26:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174974952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:46,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-03-04 07:26:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851627377] [2025-03-04 07:26:46,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:26:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:46,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:26:46,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:26:46,233 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:26:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:46,454 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2025-03-04 07:26:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:26:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 07:26:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:46,455 INFO L225 Difference]: With dead ends: 117 [2025-03-04 07:26:46,455 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 07:26:46,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:26:46,456 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:46,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 315 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:26:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 07:26:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2025-03-04 07:26:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 99 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:26:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2025-03-04 07:26:46,458 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 36 [2025-03-04 07:26:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:46,458 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2025-03-04 07:26:46,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:26:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2025-03-04 07:26:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:26:46,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:46,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:46,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:26:46,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 07:26:46,665 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:46,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1406853892, now seen corresponding path program 2 times [2025-03-04 07:26:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-04 07:26:46,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:46,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 07:26:46,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:26:46,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:26:46,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-04 07:26:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209935489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889382153] [2025-03-04 07:26:46,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:26:46,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:46,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:46,978 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:26:46,979 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:26:47,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 07:26:47,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:26:47,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:26:47,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:47,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:26:47,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:47,099 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:26:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:47,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:47,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:26:47,188 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:26:47,191 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:26:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889382153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:47,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 22 [2025-03-04 07:26:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591471679] [2025-03-04 07:26:47,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:47,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:26:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:47,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:26:47,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:26:47,233 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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:26:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:47,343 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2025-03-04 07:26:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:26:47,343 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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 41 [2025-03-04 07:26:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:47,344 INFO L225 Difference]: With dead ends: 160 [2025-03-04 07:26:47,344 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 07:26:47,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:26:47,344 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:47,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 270 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 07:26:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-04 07:26:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 135 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:26:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-03-04 07:26:47,348 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 41 [2025-03-04 07:26:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:47,348 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-03-04 07:26:47,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 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:26:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-03-04 07:26:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:26:47,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:47,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:47,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:26:47,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:47,553 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:47,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash -346304394, now seen corresponding path program 4 times [2025-03-04 07:26:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-04 07:26:47,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:26:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:47,562 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 07:26:47,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 42 statements. [2025-03-04 07:26:47,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:26:47,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632598530] [2025-03-04 07:26:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632598530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672045732] [2025-03-04 07:26:48,009 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:26:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:48,011 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:26:48,013 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:26:48,061 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 07:26:48,076 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 42 statements. [2025-03-04 07:26:48,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:26:48,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:48,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:26:48,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:48,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 07:26:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:48,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:48,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-03-04 07:26:48,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:26:48,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-03-04 07:26:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672045732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:48,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-03-04 07:26:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022784773] [2025-03-04 07:26:48,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:48,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:26:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:48,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:26:48,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:26:48,631 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 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:26:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:49,021 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2025-03-04 07:26:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:26:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 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 42 [2025-03-04 07:26:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:49,022 INFO L225 Difference]: With dead ends: 217 [2025-03-04 07:26:49,022 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 07:26:49,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:26:49,023 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:49,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 257 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:26:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 07:26:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2025-03-04 07:26:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.1111111111111112) internal successors, (200), 181 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:26:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 200 transitions. [2025-03-04 07:26:49,027 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 200 transitions. Word has length 42 [2025-03-04 07:26:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 200 transitions. [2025-03-04 07:26:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 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:26:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 200 transitions. [2025-03-04 07:26:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:26:49,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:49,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:49,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:26:49,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:49,228 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1765084417, now seen corresponding path program 3 times [2025-03-04 07:26:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:49,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152015446] [2025-03-04 07:26:49,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:26:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:49,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-04 07:26:49,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:26:49,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:26:49,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:49,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152015446] [2025-03-04 07:26:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152015446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321989134] [2025-03-04 07:26:49,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:26:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:49,442 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:26:49,443 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:26:49,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-04 07:26:49,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:26:49,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:26:49,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:49,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:26:49,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:49,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:49,736 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:26:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:49,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321989134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:49,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:49,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 07:26:49,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338876126] [2025-03-04 07:26:49,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:49,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:26:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:49,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:26:49,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:26:49,769 INFO L87 Difference]: Start difference. First operand 182 states and 200 transitions. Second operand has 20 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:26:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:49,930 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2025-03-04 07:26:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:26:49,931 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 07:26:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:49,932 INFO L225 Difference]: With dead ends: 292 [2025-03-04 07:26:49,932 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 07:26:49,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:26:49,932 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:49,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 288 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 07:26:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 237. [2025-03-04 07:26:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 235 states have (on average 1.1063829787234043) internal successors, (260), 236 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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:26:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2025-03-04 07:26:49,940 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 44 [2025-03-04 07:26:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:49,940 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2025-03-04 07:26:49,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 20 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:26:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2025-03-04 07:26:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:26:49,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:49,941 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:49,948 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:26:50,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:50,141 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:50,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1905817577, now seen corresponding path program 5 times [2025-03-04 07:26:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052364276] [2025-03-04 07:26:50,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:26:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:50,149 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 07:26:50,163 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:26:50,163 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:26:50,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:50,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052364276] [2025-03-04 07:26:50,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052364276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:50,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063487250] [2025-03-04 07:26:50,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:26:50,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:50,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:50,370 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:26:50,371 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:26:50,423 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 4 equivalence classes. [2025-03-04 07:26:50,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:26:50,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:26:50,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:50,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 07:26:50,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:50,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:26:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:50,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063487250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:50,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-04 07:26:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478431604] [2025-03-04 07:26:50,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:26:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:26:50,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:26:50,919 INFO L87 Difference]: Start difference. First operand 237 states and 260 transitions. Second operand has 32 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 32 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:26:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:51,213 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2025-03-04 07:26:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:26:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 32 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) Word has length 45 [2025-03-04 07:26:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:51,214 INFO L225 Difference]: With dead ends: 294 [2025-03-04 07:26:51,214 INFO L226 Difference]: Without dead ends: 294 [2025-03-04 07:26:51,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:26:51,215 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:51,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 397 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:26:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-04 07:26:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 261. [2025-03-04 07:26:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 259 states have (on average 1.1081081081081081) internal successors, (287), 260 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:26:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2025-03-04 07:26:51,247 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 45 [2025-03-04 07:26:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:51,247 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2025-03-04 07:26:51,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 32 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:26:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2025-03-04 07:26:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:26:51,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:51,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:51,255 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:26:51,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 07:26:51,452 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:51,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1216673412, now seen corresponding path program 6 times [2025-03-04 07:26:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385522694] [2025-03-04 07:26:51,453 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:26:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:51,459 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-03-04 07:26:51,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:26:51,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:26:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385522694] [2025-03-04 07:26:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385522694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564347624] [2025-03-04 07:26:52,396 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:26:52,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:52,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:52,398 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:26:52,400 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:26:52,457 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-03-04 07:26:52,495 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:26:52,495 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:26:52,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:52,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 07:26:52,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:52,584 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:26:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:52,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:52,730 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:26:52,731 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:26:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564347624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:52,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 35 [2025-03-04 07:26:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995064668] [2025-03-04 07:26:52,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:52,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:26:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:52,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:26:52,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:26:52,799 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand has 35 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:53,711 INFO L93 Difference]: Finished difference Result 393 states and 426 transitions. [2025-03-04 07:26:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 07:26:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-04 07:26:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:53,712 INFO L225 Difference]: With dead ends: 393 [2025-03-04 07:26:53,712 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 07:26:53,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=371, Invalid=4321, Unknown=0, NotChecked=0, Total=4692 [2025-03-04 07:26:53,714 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:53,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 599 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:26:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 07:26:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 343. [2025-03-04 07:26:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 341 states have (on average 1.1055718475073313) internal successors, (377), 342 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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:26:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 377 transitions. [2025-03-04 07:26:53,721 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 377 transitions. Word has length 51 [2025-03-04 07:26:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:53,721 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 377 transitions. [2025-03-04 07:26:53,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:53,721 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 377 transitions. [2025-03-04 07:26:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:26:53,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:53,721 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:53,728 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:26:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 07:26:53,922 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1927108347, now seen corresponding path program 7 times [2025-03-04 07:26:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12291119] [2025-03-04 07:26:53,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:26:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:53,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:26:53,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:26:53,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:53,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12291119] [2025-03-04 07:26:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12291119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46840809] [2025-03-04 07:26:54,237 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:26:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:54,239 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:26:54,239 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:26:54,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:26:54,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:26:54,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:54,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:54,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:26:54,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:54,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:54,685 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:26:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:26:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46840809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:54,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-03-04 07:26:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882171455] [2025-03-04 07:26:54,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:54,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:26:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:54,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:26:54,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:26:54,738 INFO L87 Difference]: Start difference. First operand 343 states and 377 transitions. Second operand has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:55,090 INFO L93 Difference]: Finished difference Result 403 states and 442 transitions. [2025-03-04 07:26:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:26:55,090 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-04 07:26:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:55,091 INFO L225 Difference]: With dead ends: 403 [2025-03-04 07:26:55,091 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 07:26:55,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:26:55,092 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 188 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:55,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 626 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:26:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 07:26:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 367. [2025-03-04 07:26:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 365 states have (on average 1.106849315068493) internal successors, (404), 366 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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:26:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 404 transitions. [2025-03-04 07:26:55,098 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 404 transitions. Word has length 54 [2025-03-04 07:26:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 404 transitions. [2025-03-04 07:26:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 404 transitions. [2025-03-04 07:26:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:26:55,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:55,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:55,106 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:26:55,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 07:26:55,301 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:26:55,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash -682302774, now seen corresponding path program 4 times [2025-03-04 07:26:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:55,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104105499] [2025-03-04 07:26:55,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:26:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:55,309 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:26:55,321 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 48 of 56 statements. [2025-03-04 07:26:55,321 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:26:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:26:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104105499] [2025-03-04 07:26:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104105499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920237821] [2025-03-04 07:26:56,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:26:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:56,068 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:26:56,069 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:26:56,127 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:26:56,144 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 48 of 56 statements. [2025-03-04 07:26:56,144 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:26:56,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:56,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 07:26:56,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:56,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 07:26:57,799 INFO L349 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2025-03-04 07:26:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 54 [2025-03-04 07:26:58,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:26:58,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2025-03-04 07:26:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:26:58,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:58,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:26:58,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-03-04 07:26:59,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2025-03-04 07:26:59,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2025-03-04 07:26:59,199 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:26:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:26:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920237821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:59,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 56 [2025-03-04 07:26:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297471998] [2025-03-04 07:26:59,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 07:26:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:59,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 07:26:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2870, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 07:26:59,218 INFO L87 Difference]: Start difference. First operand 367 states and 404 transitions. Second operand has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:05,417 INFO L93 Difference]: Finished difference Result 1232 states and 1350 transitions. [2025-03-04 07:27:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-04 07:27:05,418 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 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:27:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:05,420 INFO L225 Difference]: With dead ends: 1232 [2025-03-04 07:27:05,420 INFO L226 Difference]: Without dead ends: 1181 [2025-03-04 07:27:05,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3399 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2524, Invalid=11756, Unknown=0, NotChecked=0, Total=14280 [2025-03-04 07:27:05,423 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 783 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:05,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 797 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 07:27:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-04 07:27:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 575. [2025-03-04 07:27:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 573 states have (on average 1.1151832460732984) internal successors, (639), 574 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 639 transitions. [2025-03-04 07:27:05,434 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 639 transitions. Word has length 56 [2025-03-04 07:27:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:05,434 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 639 transitions. [2025-03-04 07:27:05,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 57 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 639 transitions. [2025-03-04 07:27:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:27:05,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:05,435 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:05,443 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:27:05,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 07:27:05,636 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 283843936, now seen corresponding path program 8 times [2025-03-04 07:27:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617136290] [2025-03-04 07:27:05,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:05,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 07:27:05,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:27:05,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:05,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617136290] [2025-03-04 07:27:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617136290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503034255] [2025-03-04 07:27:05,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:05,986 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:27:05,989 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:27:06,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 07:27:06,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:27:06,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:06,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:06,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 07:27:06,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:06,187 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:27:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:06,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:06,293 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:27:06,294 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:27:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503034255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:06,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:06,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-03-04 07:27:06,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353884361] [2025-03-04 07:27:06,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:06,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:27:06,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:06,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:27:06,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:27:06,350 INFO L87 Difference]: Start difference. First operand 575 states and 639 transitions. Second operand has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 31 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:06,712 INFO L93 Difference]: Finished difference Result 841 states and 926 transitions. [2025-03-04 07:27:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:27:06,712 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 31 states have internal predecessors, (95), 0 states have call successors, (0), 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 60 [2025-03-04 07:27:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:06,714 INFO L225 Difference]: With dead ends: 841 [2025-03-04 07:27:06,714 INFO L226 Difference]: Without dead ends: 792 [2025-03-04 07:27:06,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:27:06,715 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 103 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:06,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 870 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-04 07:27:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 777. [2025-03-04 07:27:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 775 states have (on average 1.1135483870967742) internal successors, (863), 776 states have internal predecessors, (863), 0 states have call successors, (0), 0 states 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:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 863 transitions. [2025-03-04 07:27:06,725 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 863 transitions. Word has length 60 [2025-03-04 07:27:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:06,725 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 863 transitions. [2025-03-04 07:27:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 31 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 863 transitions. [2025-03-04 07:27:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 07:27:06,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:06,726 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:06,732 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:27:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:06,926 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:06,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1262390977, now seen corresponding path program 9 times [2025-03-04 07:27:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369966765] [2025-03-04 07:27:06,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:06,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 6 equivalence classes. [2025-03-04 07:27:06,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 07:27:06,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 07:27:06,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369966765] [2025-03-04 07:27:07,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369966765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:07,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834810790] [2025-03-04 07:27:07,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:07,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:07,317 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:27:07,317 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:27:07,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 6 equivalence classes. [2025-03-04 07:27:07,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 07:27:07,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 07:27:07,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:07,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 07:27:07,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:07,430 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:27:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:07,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834810790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:07,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2025-03-04 07:27:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289080800] [2025-03-04 07:27:07,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:07,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 07:27:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:07,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 07:27:07,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:27:07,892 INFO L87 Difference]: Start difference. First operand 777 states and 863 transitions. Second operand has 42 states, 41 states have (on average 3.707317073170732) internal successors, (152), 42 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:08,220 INFO L93 Difference]: Finished difference Result 869 states and 964 transitions. [2025-03-04 07:27:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:27:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.707317073170732) internal successors, (152), 42 states have internal predecessors, (152), 0 states have call successors, (0), 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 63 [2025-03-04 07:27:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:08,222 INFO L225 Difference]: With dead ends: 869 [2025-03-04 07:27:08,222 INFO L226 Difference]: Without dead ends: 869 [2025-03-04 07:27:08,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=346, Invalid=2104, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 07:27:08,223 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 129 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:08,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 383 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-04 07:27:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 813. [2025-03-04 07:27:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 1.1146732429099877) internal successors, (904), 812 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 904 transitions. [2025-03-04 07:27:08,233 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 904 transitions. Word has length 63 [2025-03-04 07:27:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:08,233 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 904 transitions. [2025-03-04 07:27:08,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.707317073170732) internal successors, (152), 42 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 904 transitions. [2025-03-04 07:27:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 07:27:08,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:08,234 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:08,250 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:27:08,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 07:27:08,444 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:08,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1118246746, now seen corresponding path program 10 times [2025-03-04 07:27:08,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:08,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-03-04 07:27:08,444 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:08,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-04 07:27:08,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 69 statements. [2025-03-04 07:27:08,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:08,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 96 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-03-04 07:27:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559869536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398528643] [2025-03-04 07:27:09,508 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:09,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:09,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:09,510 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:27:09,511 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:27:09,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-04 07:27:09,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 69 statements. [2025-03-04 07:27:09,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:09,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:09,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-04 07:27:09,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:09,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 07:27:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 86 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:10,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2025-03-04 07:27:11,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:27:11,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 67 [2025-03-04 07:27:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 96 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:11,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398528643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:11,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:11,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 67 [2025-03-04 07:27:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974581313] [2025-03-04 07:27:11,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:11,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-04 07:27:11,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:11,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-04 07:27:11,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3861, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 07:27:11,431 INFO L87 Difference]: Start difference. First operand 813 states and 904 transitions. Second operand has 67 states, 67 states have (on average 2.0) internal successors, (134), 67 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:12,416 INFO L93 Difference]: Finished difference Result 1137 states and 1254 transitions. [2025-03-04 07:27:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 07:27:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.0) internal successors, (134), 67 states have internal predecessors, (134), 0 states have call successors, (0), 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 69 [2025-03-04 07:27:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:12,419 INFO L225 Difference]: With dead ends: 1137 [2025-03-04 07:27:12,419 INFO L226 Difference]: Without dead ends: 1082 [2025-03-04 07:27:12,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2949 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1044, Invalid=7328, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 07:27:12,420 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:12,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 414 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:27:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-03-04 07:27:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1045. [2025-03-04 07:27:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1043 states have (on average 1.115052732502397) internal successors, (1163), 1044 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states 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:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1163 transitions. [2025-03-04 07:27:12,432 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1163 transitions. Word has length 69 [2025-03-04 07:27:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:12,433 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1163 transitions. [2025-03-04 07:27:12,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.0) internal successors, (134), 67 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1163 transitions. [2025-03-04 07:27:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 07:27:12,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:12,434 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:12,440 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:27:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 07:27:12,635 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash 521320249, now seen corresponding path program 1 times [2025-03-04 07:27:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214676382] [2025-03-04 07:27:12,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:12,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:27:12,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:27:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:27:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214676382] [2025-03-04 07:27:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214676382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937371459] [2025-03-04 07:27:12,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:27:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:12,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:12,845 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:27:12,846 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:27:12,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:27:12,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:27:12,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:12,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:12,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 07:27:12,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:12,991 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:27:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:27:13,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:13,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:27:13,105 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:27:13,106 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:27:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:27:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937371459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:13,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 24 [2025-03-04 07:27:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726086939] [2025-03-04 07:27:13,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:27:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:13,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:27:13,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:27:13,156 INFO L87 Difference]: Start difference. First operand 1045 states and 1163 transitions. Second operand has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:13,271 INFO L93 Difference]: Finished difference Result 1625 states and 1774 transitions. [2025-03-04 07:27:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:27:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-04 07:27:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:13,273 INFO L225 Difference]: With dead ends: 1625 [2025-03-04 07:27:13,273 INFO L226 Difference]: Without dead ends: 1201 [2025-03-04 07:27:13,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:27:13,273 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:13,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 496 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:27:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2025-03-04 07:27:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1113. [2025-03-04 07:27:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1111 states have (on average 1.116111611161116) internal successors, (1240), 1112 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1240 transitions. [2025-03-04 07:27:13,284 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1240 transitions. Word has length 71 [2025-03-04 07:27:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1240 transitions. [2025-03-04 07:27:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.125) internal successors, (99), 24 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1240 transitions. [2025-03-04 07:27:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 07:27:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:13,286 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:13,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:27:13,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 07:27:13,487 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:13,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1797813349, now seen corresponding path program 11 times [2025-03-04 07:27:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:13,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113758332] [2025-03-04 07:27:13,487 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:27:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:13,495 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 7 equivalence classes. [2025-03-04 07:27:13,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:27:13,504 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 07:27:13,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 37 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113758332] [2025-03-04 07:27:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113758332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712801139] [2025-03-04 07:27:13,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:27:13,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:13,842 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:27:13,844 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:27:13,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 72 statements into 7 equivalence classes. [2025-03-04 07:27:13,950 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:27:13,950 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 07:27:13,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:13,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 07:27:13,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:13,957 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:27:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:14,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712801139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:14,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:14,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-03-04 07:27:14,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638484427] [2025-03-04 07:27:14,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:14,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 07:27:14,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:14,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 07:27:14,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:27:14,636 INFO L87 Difference]: Start difference. First operand 1113 states and 1240 transitions. Second operand has 47 states, 46 states have (on average 3.847826086956522) internal successors, (177), 47 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:15,042 INFO L93 Difference]: Finished difference Result 1228 states and 1366 transitions. [2025-03-04 07:27:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:27:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.847826086956522) internal successors, (177), 47 states have internal predecessors, (177), 0 states have call successors, (0), 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:27:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:15,045 INFO L225 Difference]: With dead ends: 1228 [2025-03-04 07:27:15,045 INFO L226 Difference]: Without dead ends: 1228 [2025-03-04 07:27:15,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=419, Invalid=2661, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 07:27:15,046 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 179 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:15,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 543 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:27:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-03-04 07:27:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1155. [2025-03-04 07:27:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1153 states have (on average 1.1170858629661753) internal successors, (1288), 1154 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1288 transitions. [2025-03-04 07:27:15,058 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1288 transitions. Word has length 72 [2025-03-04 07:27:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:15,059 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1288 transitions. [2025-03-04 07:27:15,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.847826086956522) internal successors, (177), 47 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1288 transitions. [2025-03-04 07:27:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 07:27:15,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:15,060 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:15,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 07:27:15,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 07:27:15,261 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:15,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash -854783882, now seen corresponding path program 2 times [2025-03-04 07:27:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:15,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086128798] [2025-03-04 07:27:15,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:15,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-04 07:27:15,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 07:27:15,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 1 proven. 80 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:27:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086128798] [2025-03-04 07:27:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086128798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481078565] [2025-03-04 07:27:15,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:15,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:15,478 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:27:15,479 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:27:15,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-04 07:27:15,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 07:27:15,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:15,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:15,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 07:27:15,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 5 proven. 76 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:27:15,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:15,928 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:27:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 5 proven. 76 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:27:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481078565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:16,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 07:27:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120942576] [2025-03-04 07:27:16,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:27:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:16,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:27:16,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:27:16,009 INFO L87 Difference]: Start difference. First operand 1155 states and 1288 transitions. Second operand has 26 states, 25 states have (on average 5.92) internal successors, (148), 26 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:16,186 INFO L93 Difference]: Finished difference Result 2222 states and 2452 transitions. [2025-03-04 07:27:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:27:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.92) internal successors, (148), 26 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-04 07:27:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:16,191 INFO L225 Difference]: With dead ends: 2222 [2025-03-04 07:27:16,191 INFO L226 Difference]: Without dead ends: 2222 [2025-03-04 07:27:16,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:27:16,191 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:16,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 448 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-04 07:27:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1529. [2025-03-04 07:27:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1527 states have (on average 1.1152586771447281) internal successors, (1703), 1528 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states 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:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1703 transitions. [2025-03-04 07:27:16,210 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1703 transitions. Word has length 74 [2025-03-04 07:27:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:16,210 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 1703 transitions. [2025-03-04 07:27:16,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.92) internal successors, (148), 26 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1703 transitions. [2025-03-04 07:27:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 07:27:16,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:16,211 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:16,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 07:27:16,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:16,412 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:16,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1627456330, now seen corresponding path program 12 times [2025-03-04 07:27:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:16,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402134745] [2025-03-04 07:27:16,412 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:27:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:16,420 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 78 statements into 8 equivalence classes. [2025-03-04 07:27:16,439 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 07:27:16,439 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 07:27:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 159 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402134745] [2025-03-04 07:27:16,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402134745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008007230] [2025-03-04 07:27:16,884 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:27:16,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:16,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:16,886 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:27:16,888 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:27:16,971 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 78 statements into 8 equivalence classes. [2025-03-04 07:27:17,080 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 07:27:17,080 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 07:27:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:17,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-04 07:27:17,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:17,198 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:27:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 159 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:17,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:17,312 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:27:17,313 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:27:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 25 proven. 159 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:17,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008007230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:17,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:17,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 37 [2025-03-04 07:27:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840890728] [2025-03-04 07:27:17,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:17,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 07:27:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:17,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 07:27:17,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:27:17,378 INFO L87 Difference]: Start difference. First operand 1529 states and 1703 transitions. Second operand has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 37 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:18,012 INFO L93 Difference]: Finished difference Result 2046 states and 2268 transitions. [2025-03-04 07:27:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 07:27:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 37 states have internal predecessors, (119), 0 states have call successors, (0), 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 78 [2025-03-04 07:27:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:18,016 INFO L225 Difference]: With dead ends: 2046 [2025-03-04 07:27:18,016 INFO L226 Difference]: Without dead ends: 1926 [2025-03-04 07:27:18,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=2545, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 07:27:18,016 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:18,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1197 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:27:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-03-04 07:27:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1890. [2025-03-04 07:27:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1888 states have (on average 1.1159957627118644) internal successors, (2107), 1889 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states 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:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2107 transitions. [2025-03-04 07:27:18,034 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2107 transitions. Word has length 78 [2025-03-04 07:27:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2107 transitions. [2025-03-04 07:27:18,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.2162162162162162) internal successors, (119), 37 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2107 transitions. [2025-03-04 07:27:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:27:18,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:18,036 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:18,042 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:27:18,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-04 07:27:18,236 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash -349161894, now seen corresponding path program 3 times [2025-03-04 07:27:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369536180] [2025-03-04 07:27:18,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:18,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 6 equivalence classes. [2025-03-04 07:27:18,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 74 of 80 statements. [2025-03-04 07:27:18,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 07:27:18,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 107 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:27:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369536180] [2025-03-04 07:27:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369536180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268626929] [2025-03-04 07:27:19,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:19,111 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:27:19,111 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:27:19,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 6 equivalence classes. [2025-03-04 07:27:19,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 74 of 80 statements. [2025-03-04 07:27:19,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 07:27:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:19,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 07:27:19,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:19,359 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:27:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 40 proven. 66 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:27:19,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:19,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:27:19,642 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:27:19,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:27:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:27:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268626929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:19,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 16] total 40 [2025-03-04 07:27:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559320633] [2025-03-04 07:27:19,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:19,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:27:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:19,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:27:19,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:27:19,708 INFO L87 Difference]: Start difference. First operand 1890 states and 2107 transitions. Second operand has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:20,576 INFO L93 Difference]: Finished difference Result 3115 states and 3428 transitions. [2025-03-04 07:27:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 07:27:20,576 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 0 states have call successors, (0), 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:27:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:20,580 INFO L225 Difference]: With dead ends: 3115 [2025-03-04 07:27:20,580 INFO L226 Difference]: Without dead ends: 2178 [2025-03-04 07:27:20,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=2877, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 07:27:20,581 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:20,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 813 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:27:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2025-03-04 07:27:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1967. [2025-03-04 07:27:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1965 states have (on average 1.1165394402035624) internal successors, (2194), 1966 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states 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:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2194 transitions. [2025-03-04 07:27:20,616 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2194 transitions. Word has length 80 [2025-03-04 07:27:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:20,616 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2194 transitions. [2025-03-04 07:27:20,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.4) internal successors, (136), 40 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2194 transitions. [2025-03-04 07:27:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 07:27:20,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:20,618 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:20,625 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:27:20,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:20,819 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:20,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash -280412565, now seen corresponding path program 13 times [2025-03-04 07:27:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:20,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316268363] [2025-03-04 07:27:20,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:27:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:20,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 07:27:20,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 07:27:20,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:20,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 35 proven. 168 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316268363] [2025-03-04 07:27:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316268363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128547579] [2025-03-04 07:27:21,331 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:27:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:21,333 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:27:21,334 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:27:21,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 07:27:21,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 07:27:21,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:27:21,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:21,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-04 07:27:21,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 51 proven. 152 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:21,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:21,947 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:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 51 proven. 152 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128547579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:22,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:22,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 43 [2025-03-04 07:27:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290606846] [2025-03-04 07:27:22,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:22,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 07:27:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:22,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 07:27:22,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:27:22,036 INFO L87 Difference]: Start difference. First operand 1967 states and 2194 transitions. Second operand has 44 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 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:27:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:22,611 INFO L93 Difference]: Finished difference Result 2144 states and 2388 transitions. [2025-03-04 07:27:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:27:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 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 81 [2025-03-04 07:27:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:22,615 INFO L225 Difference]: With dead ends: 2144 [2025-03-04 07:27:22,615 INFO L226 Difference]: Without dead ends: 2144 [2025-03-04 07:27:22,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 130 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=2526, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 07:27:22,616 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 191 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:22,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1064 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:27:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2025-03-04 07:27:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2027. [2025-03-04 07:27:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2025 states have (on average 1.1175308641975308) internal successors, (2263), 2026 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states 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:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2263 transitions. [2025-03-04 07:27:22,634 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2263 transitions. Word has length 81 [2025-03-04 07:27:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:22,634 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2263 transitions. [2025-03-04 07:27:22,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.953488372093023) internal successors, (170), 44 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:27:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2263 transitions. [2025-03-04 07:27:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 07:27:22,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:22,636 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:22,644 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:27:22,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:22,837 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:22,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -926877251, now seen corresponding path program 4 times [2025-03-04 07:27:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130553101] [2025-03-04 07:27:22,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:22,845 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-03-04 07:27:22,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 70 of 83 statements. [2025-03-04 07:27:22,861 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:22,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 94 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 07:27:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130553101] [2025-03-04 07:27:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130553101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549091036] [2025-03-04 07:27:24,599 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:24,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:24,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:24,601 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:27:24,602 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:27:24,687 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-03-04 07:27:24,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 70 of 83 statements. [2025-03-04 07:27:24,716 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:24,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-04 07:27:24,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:24,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 07:27:27,525 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-03-04 07:27:27,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 68 [2025-03-04 07:27:27,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:27:27,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 44 [2025-03-04 07:27:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 69 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:27:27,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:29,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:27:29,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 65 [2025-03-04 07:27:29,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2025-03-04 07:27:29,566 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 15 treesize of output 11 [2025-03-04 07:27:29,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 123 [2025-03-04 07:27:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:27:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549091036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:29,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 75 [2025-03-04 07:27:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269689799] [2025-03-04 07:27:29,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:29,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-04 07:27:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:29,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-04 07:27:29,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=5109, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 07:27:29,595 INFO L87 Difference]: Start difference. First operand 2027 states and 2263 transitions. Second operand has 76 states, 75 states have (on average 2.44) internal successors, (183), 76 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:52,055 INFO L93 Difference]: Finished difference Result 4275 states and 4710 transitions. [2025-03-04 07:27:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-04 07:27:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 2.44) internal successors, (183), 76 states have internal predecessors, (183), 0 states have call successors, (0), 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:27:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:52,057 INFO L225 Difference]: With dead ends: 4275 [2025-03-04 07:27:52,057 INFO L226 Difference]: Without dead ends: 1411 [2025-03-04 07:27:52,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3999 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=3377, Invalid=14982, Unknown=1, NotChecked=0, Total=18360 [2025-03-04 07:27:52,059 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 307 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:52,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 853 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2372 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 07:27:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-03-04 07:27:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 337. [2025-03-04 07:27:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.1071428571428572) internal successors, (372), 336 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 372 transitions. [2025-03-04 07:27:52,064 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 372 transitions. Word has length 83 [2025-03-04 07:27:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:52,064 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 372 transitions. [2025-03-04 07:27:52,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 2.44) internal successors, (183), 76 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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,064 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 372 transitions. [2025-03-04 07:27:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 07:27:52,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:52,065 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:52,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 07:27:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:52,265 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:52,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 893890768, now seen corresponding path program 14 times [2025-03-04 07:27:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415698538] [2025-03-04 07:27:52,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:52,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 07:27:52,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 07:27:52,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 29 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:52,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415698538] [2025-03-04 07:27:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415698538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067792779] [2025-03-04 07:27:52,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:27:52,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:52,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:52,804 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:27:52,805 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:27:52,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-04 07:27:52,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 07:27:52,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:27:52,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:52,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-04 07:27:52,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:52,963 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:27:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 29 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:53,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:53,052 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:27:53,053 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:27:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 29 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067792779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:53,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 27 [2025-03-04 07:27:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418738867] [2025-03-04 07:27:53,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:27:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:27:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:27:53,125 INFO L87 Difference]: Start difference. First operand 337 states and 372 transitions. Second operand has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:53,659 INFO L93 Difference]: Finished difference Result 589 states and 645 transitions. [2025-03-04 07:27:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 07:27:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-04 07:27:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:53,662 INFO L225 Difference]: With dead ends: 589 [2025-03-04 07:27:53,662 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 07:27:53,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=1675, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:27:53,663 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 82 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:53,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 827 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:27:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 07:27:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 349. [2025-03-04 07:27:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.103448275862069) internal successors, (384), 348 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 384 transitions. [2025-03-04 07:27:53,665 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 384 transitions. Word has length 87 [2025-03-04 07:27:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:53,665 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 384 transitions. [2025-03-04 07:27:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 384 transitions. [2025-03-04 07:27:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 07:27:53,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:53,666 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:53,676 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:27:53,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:53,867 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:53,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1568052529, now seen corresponding path program 15 times [2025-03-04 07:27:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:53,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902175287] [2025-03-04 07:27:53,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:53,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 9 equivalence classes. [2025-03-04 07:27:53,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 07:27:53,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 07:27:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 51 proven. 217 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902175287] [2025-03-04 07:27:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902175287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245254162] [2025-03-04 07:27:54,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:27:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:54,398 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:27:54,399 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:27:54,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 9 equivalence classes. [2025-03-04 07:27:54,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 07:27:54,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 07:27:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:54,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-04 07:27:54,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 70 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:54,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:27:55,146 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:27:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 70 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245254162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:27:55,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:27:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 47 [2025-03-04 07:27:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483552443] [2025-03-04 07:27:55,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:27:55,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 07:27:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:27:55,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 07:27:55,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:27:55,242 INFO L87 Difference]: Start difference. First operand 349 states and 384 transitions. Second operand has 48 states, 47 states have (on average 4.0) internal successors, (188), 48 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:27:55,589 INFO L93 Difference]: Finished difference Result 420 states and 461 transitions. [2025-03-04 07:27:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:27:55,590 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.0) internal successors, (188), 48 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-04 07:27:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:27:55,591 INFO L225 Difference]: With dead ends: 420 [2025-03-04 07:27:55,591 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 07:27:55,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=527, Invalid=2895, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 07:27:55,591 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 344 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:27:55,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 312 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:27:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 07:27:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 373. [2025-03-04 07:27:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.1048387096774193) internal successors, (411), 372 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 411 transitions. [2025-03-04 07:27:55,594 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 411 transitions. Word has length 90 [2025-03-04 07:27:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:27:55,594 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 411 transitions. [2025-03-04 07:27:55,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.0) internal successors, (188), 48 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:27:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 411 transitions. [2025-03-04 07:27:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 07:27:55,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:27:55,599 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:27:55,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 07:27:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 07:27:55,800 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:27:55,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:27:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1264188876, now seen corresponding path program 16 times [2025-03-04 07:27:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:27:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050924238] [2025-03-04 07:27:55,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:27:55,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-03-04 07:27:55,820 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 76 of 96 statements. [2025-03-04 07:27:55,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:55,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:27:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:27:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050924238] [2025-03-04 07:27:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050924238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:27:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811508131] [2025-03-04 07:27:57,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:27:57,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:27:57,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:27:57,950 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:27:57,951 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:27:58,044 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-03-04 07:27:58,081 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 76 of 96 statements. [2025-03-04 07:27:58,081 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:27:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:27:58,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-04 07:27:58,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:27:58,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 07:28:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 209 proven. 108 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:28:01,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:28:01,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2025-03-04 07:28:01,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:28:01,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 100 [2025-03-04 07:28:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:28:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811508131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:28:02,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:28:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2025-03-04 07:28:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929032798] [2025-03-04 07:28:02,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:28:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-04 07:28:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:28:02,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-04 07:28:02,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1218, Invalid=8682, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 07:28:02,539 INFO L87 Difference]: Start difference. First operand 373 states and 411 transitions. Second operand has 100 states, 100 states have (on average 1.97) internal successors, (197), 100 states have internal predecessors, (197), 0 states have call successors, (0), 0 states 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:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:28:04,681 INFO L93 Difference]: Finished difference Result 652 states and 714 transitions. [2025-03-04 07:28:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 07:28:04,681 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.97) internal successors, (197), 100 states have internal predecessors, (197), 0 states have call successors, (0), 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:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:28:04,682 INFO L225 Difference]: With dead ends: 652 [2025-03-04 07:28:04,682 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 07:28:04,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6900 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2247, Invalid=16385, Unknown=0, NotChecked=0, Total=18632 [2025-03-04 07:28:04,683 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 51 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:28:04,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 512 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 07:28:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 07:28:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 385. [2025-03-04 07:28:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.1015625) internal successors, (423), 384 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 423 transitions. [2025-03-04 07:28:04,685 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 423 transitions. Word has length 96 [2025-03-04 07:28:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:28:04,685 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 423 transitions. [2025-03-04 07:28:04,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 1.97) internal successors, (197), 100 states have internal predecessors, (197), 0 states have call successors, (0), 0 states 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:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 423 transitions. [2025-03-04 07:28:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 07:28:04,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:28:04,686 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:28:04,693 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:04,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 07:28:04,886 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:28:04,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:28:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 141301525, now seen corresponding path program 17 times [2025-03-04 07:28:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:28:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906112002] [2025-03-04 07:28:04,887 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:28:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms