./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.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/substring-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:29:17,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:29:17,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:29:17,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:29:17,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:29:17,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:29:17,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:29:17,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:29:17,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:29:17,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:29:17,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:29:17,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:29:17,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:29:17,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:29:17,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:29:17,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:29:17,556 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:29:17,557 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:29:17,557 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:29:17,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:29:17,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:29:17,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:29:17,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:29:17,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:29:17,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:29:17,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:29:17,558 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 -> 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e [2025-03-04 07:29:17,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:29:17,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:29:17,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:29:17,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:29:17,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:29:17,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2025-03-04 07:29:18,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e558da38/ab59ffcd5aa94073ab01d268841f9982/FLAGe1d0c09de [2025-03-04 07:29:19,199 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:29:19,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2025-03-04 07:29:19,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e558da38/ab59ffcd5aa94073ab01d268841f9982/FLAGe1d0c09de [2025-03-04 07:29:19,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e558da38/ab59ffcd5aa94073ab01d268841f9982 [2025-03-04 07:29:19,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:29:19,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:29:19,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:29:19,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:29:19,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:29:19,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0e7ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19, skipping insertion in model container [2025-03-04 07:29:19,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:29:19,701 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:29:19,701 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:29:19,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:29:19,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:29:19,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:29:19,769 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:29:19,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19 WrapperNode [2025-03-04 07:29:19,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:29:19,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:29:19,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:29:19,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:29:19,774 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:29:19" (1/1) ... [2025-03-04 07:29:19,780 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:29:19" (1/1) ... [2025-03-04 07:29:19,791 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2025-03-04 07:29:19,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:29:19,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:29:19,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:29:19,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:29:19,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,813 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 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:29:19,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:29:19,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:29:19,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:29:19,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:29:19,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (1/1) ... [2025-03-04 07:29:19,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:29:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:19,852 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:29:19,855 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:29:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:29:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:29:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:29:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:29:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:29:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:29:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:29:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:29:19,937 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:29:19,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:29:20,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_#t~ret19#1;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; [2025-03-04 07:29:20,129 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-04 07:29:20,129 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:29:20,138 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:29:20,138 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:29:20,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:29:20 BoogieIcfgContainer [2025-03-04 07:29:20,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:29:20,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:29:20,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:29:20,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:29:20,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:29:19" (1/3) ... [2025-03-04 07:29:20,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793f056f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:29:20, skipping insertion in model container [2025-03-04 07:29:20,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:29:19" (2/3) ... [2025-03-04 07:29:20,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793f056f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:29:20, skipping insertion in model container [2025-03-04 07:29:20,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:29:20" (3/3) ... [2025-03-04 07:29:20,146 INFO L128 eAbstractionObserver]: Analyzing ICFG substring-alloca-2.i [2025-03-04 07:29:20,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:29:20,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG substring-alloca-2.i that has 1 procedures, 49 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-03-04 07:29:20,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:29:20,191 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;@78464a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:29:20,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 07:29:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 2.0) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:29:20,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:20,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:20,198 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:29:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2110388093, now seen corresponding path program 1 times [2025-03-04 07:29:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153843968] [2025-03-04 07:29:20,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:20,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:29:20,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:29:20,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:20,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:20,457 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:29:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153843968] [2025-03-04 07:29:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153843968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:20,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:29:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684601886] [2025-03-04 07:29:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:29:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:20,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:29:20,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:29:20,480 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 2.0) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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:29:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:20,523 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-04 07:29:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:29:20,525 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:29:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:20,528 INFO L225 Difference]: With dead ends: 47 [2025-03-04 07:29:20,528 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:29:20,529 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:29:20,531 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:20,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:29:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 07:29:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-04 07:29:20,551 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 7 [2025-03-04 07:29:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:20,551 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-04 07:29:20,551 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:29:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-04 07:29:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:29:20,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:20,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:20,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:29:20,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2110388094, now seen corresponding path program 1 times [2025-03-04 07:29:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803286083] [2025-03-04 07:29:20,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:29:20,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:29:20,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:20,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:20,766 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:29:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803286083] [2025-03-04 07:29:20,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803286083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:20,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:20,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:29:20,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440086750] [2025-03-04 07:29:20,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:20,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:29:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:20,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:29:20,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:29:20,768 INFO L87 Difference]: Start difference. First operand 45 states and 52 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:29:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:20,857 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-03-04 07:29:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:29:20,858 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:29:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:20,858 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:29:20,858 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:29:20,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:20,859 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:20,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 108 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:29:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-04 07:29:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.8333333333333333) 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:29:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-04 07:29:20,864 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 7 [2025-03-04 07:29:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:20,864 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-04 07:29:20,864 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:29:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-04 07:29:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:29:20,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:20,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:20,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:29:20,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:20,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash 997516406, now seen corresponding path program 1 times [2025-03-04 07:29:20,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:20,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590260573] [2025-03-04 07:29:20,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:20,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:20,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:29:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:29:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:21,007 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:29:21,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590260573] [2025-03-04 07:29:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590260573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:29:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318931089] [2025-03-04 07:29:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:29:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:21,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:29:21,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:29:21,010 INFO L87 Difference]: Start difference. First operand 47 states and 55 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:29:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:21,067 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-03-04 07:29:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:29:21,067 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:29:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:21,067 INFO L225 Difference]: With dead ends: 54 [2025-03-04 07:29:21,067 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 07:29:21,068 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:29:21,068 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:21,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 108 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 07:29:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-04 07:29:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-04 07:29:21,074 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 8 [2025-03-04 07:29:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:21,074 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-04 07:29:21,074 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:29:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-03-04 07:29:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:29:21,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:21,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:21,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:29:21,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:21,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 997516565, now seen corresponding path program 1 times [2025-03-04 07:29:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:21,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146674251] [2025-03-04 07:29:21,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:29:21,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:29:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:21,109 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:29:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146674251] [2025-03-04 07:29:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146674251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:29:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431766925] [2025-03-04 07:29:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:29:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:21,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:29:21,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:29:21,112 INFO L87 Difference]: Start difference. First operand 51 states and 62 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:29:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:21,128 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-03-04 07:29:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:29:21,129 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:29:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:21,129 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:29:21,129 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:29:21,130 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:29:21,130 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:21,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:29:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-03-04 07:29:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-03-04 07:29:21,137 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 8 [2025-03-04 07:29:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-03-04 07:29:21,137 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:29:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-03-04 07:29:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:29:21,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:21,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:21,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:29:21,139 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:29:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 998440086, now seen corresponding path program 1 times [2025-03-04 07:29:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570621586] [2025-03-04 07:29:21,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:21,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:29:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:29:21,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:21,266 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:29:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570621586] [2025-03-04 07:29:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570621586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:29:21,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214038949] [2025-03-04 07:29:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:21,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:29:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:21,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:29:21,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:21,268 INFO L87 Difference]: Start difference. First operand 59 states and 73 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:29:21,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:21,326 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2025-03-04 07:29:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:29:21,326 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:29:21,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:21,327 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:29:21,327 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:29:21,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:29:21,327 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:21,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 86 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:29:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 07:29:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-04 07:29:21,334 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 8 [2025-03-04 07:29:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:21,334 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-04 07:29:21,334 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:29:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-04 07:29:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:29:21,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:21,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:21,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:29:21,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 998440087, now seen corresponding path program 1 times [2025-03-04 07:29:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980371176] [2025-03-04 07:29:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:21,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:29:21,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:29:21,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:21,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:21,478 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:29:21,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:21,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980371176] [2025-03-04 07:29:21,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980371176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:21,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:21,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:29:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293214933] [2025-03-04 07:29:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:21,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:29:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:21,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:29:21,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:21,479 INFO L87 Difference]: Start difference. First operand 57 states and 70 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:29:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:21,549 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2025-03-04 07:29:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:29:21,550 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:29:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:21,550 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:29:21,550 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 07:29:21,551 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:29:21,552 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:21,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 93 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 07:29:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 07:29:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.6521739130434783) 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:29:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-04 07:29:21,559 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 8 [2025-03-04 07:29:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-04 07:29:21,559 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:29:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-04 07:29:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:29:21,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:21,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:29:21,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:21,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash 858237496, now seen corresponding path program 1 times [2025-03-04 07:29:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074983799] [2025-03-04 07:29:21,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:21,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:29:21,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:29:21,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:21,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:21,630 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:29:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:21,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074983799] [2025-03-04 07:29:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074983799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:21,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:21,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:29:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341604006] [2025-03-04 07:29:21,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:21,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:29:21,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:21,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:29:21,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:29:21,632 INFO L87 Difference]: Start difference. First operand 61 states and 76 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:29:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:21,670 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-04 07:29:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:29:21,671 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:29:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:21,671 INFO L225 Difference]: With dead ends: 66 [2025-03-04 07:29:21,671 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 07:29:21,671 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:29:21,672 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:21,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 110 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 07:29:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-04 07:29:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.6326530612244898) 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:29:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-04 07:29:21,675 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 9 [2025-03-04 07:29:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:21,675 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 07:29:21,675 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:29:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-04 07:29:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:29:21,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:21,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:29:21,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:21,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 886866647, now seen corresponding path program 1 times [2025-03-04 07:29:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705833491] [2025-03-04 07:29:21,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:21,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:29:21,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:29:21,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:21,790 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:29:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705833491] [2025-03-04 07:29:21,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705833491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:21,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:21,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:29:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275689434] [2025-03-04 07:29:21,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:21,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:29:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:21,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:29:21,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:21,791 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:29:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:21,846 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-04 07:29:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:29:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:29:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:21,848 INFO L225 Difference]: With dead ends: 70 [2025-03-04 07:29:21,848 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 07:29:21,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:21,848 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:21,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 117 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 07:29:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2025-03-04 07:29:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.6326530612244898) 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:29:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-04 07:29:21,853 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 9 [2025-03-04 07:29:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:21,854 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-04 07:29:21,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:29:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-04 07:29:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:29:21,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:21,854 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:21,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:29:21,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash 840424666, now seen corresponding path program 1 times [2025-03-04 07:29:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870627914] [2025-03-04 07:29:21,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:21,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:29:21,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:29:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:22,047 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:29:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870627914] [2025-03-04 07:29:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870627914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405066583] [2025-03-04 07:29:22,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:22,050 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:29:22,052 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:29:22,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:29:22,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:29:22,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:22,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:22,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:29:22,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:22,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:29:22,150 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:29:22,157 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:29:22,330 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:29:22,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:22,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:29:22,517 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:29:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405066583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:22,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 07:29:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807915310] [2025-03-04 07:29:22,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:22,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:29:22,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:22,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:29:22,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:29:22,520 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 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:29:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:22,728 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2025-03-04 07:29:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:29:22,728 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 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 10 [2025-03-04 07:29:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:22,729 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:29:22,729 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:29:22,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:29:22,730 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:22,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 269 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:29:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-03-04 07:29:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.6170212765957446) 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:29:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-04 07:29:22,733 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 10 [2025-03-04 07:29:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-04 07:29:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 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:29:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-04 07:29:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:29:22,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:22,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:22,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:22,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 132512211, now seen corresponding path program 1 times [2025-03-04 07:29:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036011591] [2025-03-04 07:29:22,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:22,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:29:22,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:29:22,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:22,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:22,977 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:29:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:22,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036011591] [2025-03-04 07:29:22,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036011591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:22,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:22,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:29:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430215627] [2025-03-04 07:29:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:22,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:29:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:22,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:29:22,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:29:22,978 INFO L87 Difference]: Start difference. First operand 61 states and 76 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:29:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:23,009 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-03-04 07:29:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:29:23,009 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:29:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:23,010 INFO L225 Difference]: With dead ends: 60 [2025-03-04 07:29:23,010 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 07:29:23,010 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:29:23,010 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:23,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 07:29:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 07:29:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 59 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-04 07:29:23,012 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 11 [2025-03-04 07:29:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:23,012 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-04 07:29:23,014 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:29:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-04 07:29:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:29:23,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:23,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:23,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:29:23,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:23,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 132512212, now seen corresponding path program 1 times [2025-03-04 07:29:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60912442] [2025-03-04 07:29:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:23,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:29:23,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:29:23,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:23,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:23,091 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:29:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:23,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60912442] [2025-03-04 07:29:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60912442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:23,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:23,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:29:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315427871] [2025-03-04 07:29:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:23,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:29:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:23,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:29:23,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:23,092 INFO L87 Difference]: Start difference. First operand 60 states and 75 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:29:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:23,172 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2025-03-04 07:29:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:29:23,172 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:29:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:23,172 INFO L225 Difference]: With dead ends: 84 [2025-03-04 07:29:23,172 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 07:29:23,173 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:29:23,173 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:23,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 117 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 07:29:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 61. [2025-03-04 07:29:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.5833333333333333) 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:29:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-04 07:29:23,175 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 11 [2025-03-04 07:29:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:23,175 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-04 07:29:23,175 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:29:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-04 07:29:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:29:23,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:23,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:23,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:29:23,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 283355802, now seen corresponding path program 1 times [2025-03-04 07:29:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237470826] [2025-03-04 07:29:23,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:23,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:29:23,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:29:23,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:23,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237470826] [2025-03-04 07:29:23,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237470826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:23,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645617450] [2025-03-04 07:29:23,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:23,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:23,366 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:29:23,368 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:29:23,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:29:23,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:29:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:23,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:29:23,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:23,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:29:23,426 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:29:23,431 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:29:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:23,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645617450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:23,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:23,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 07:29:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035674475] [2025-03-04 07:29:23,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:23,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:29:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:23,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:29:23,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:29:23,699 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:23,859 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-04 07:29:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:29:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:29:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:23,860 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:29:23,860 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 07:29:23,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:29:23,861 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:23,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 194 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 07:29:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2025-03-04 07:29:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.5526315789473684) 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:29:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-04 07:29:23,862 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 11 [2025-03-04 07:29:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-04 07:29:23,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-04 07:29:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:29:23,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:23,866 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:23,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:24,070 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,SelfDestructingSolverStorable11 [2025-03-04 07:29:24,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1880096219, now seen corresponding path program 1 times [2025-03-04 07:29:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889100500] [2025-03-04 07:29:24,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:29:24,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:29:24,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:24,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:24,196 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:29:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889100500] [2025-03-04 07:29:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889100500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093475503] [2025-03-04 07:29:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:24,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:24,198 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:29:24,200 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:29:24,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:29:24,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:29:24,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:24,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:29:24,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:24,254 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:29:24,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:29:24,405 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:29:24,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:24,561 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:29:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093475503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:24,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-03-04 07:29:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035063768] [2025-03-04 07:29:24,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:24,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:29:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:24,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:29:24,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:29:24,562 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:24,718 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-04 07:29:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:29:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:29:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:24,719 INFO L225 Difference]: With dead ends: 51 [2025-03-04 07:29:24,719 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:29:24,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:29:24,720 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:24,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 177 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:29:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-04 07:29:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 47 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:29:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-03-04 07:29:24,722 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 11 [2025-03-04 07:29:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:24,722 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-03-04 07:29:24,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-03-04 07:29:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:29:24,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:24,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:24,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:29:24,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:24,926 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1846564333, now seen corresponding path program 1 times [2025-03-04 07:29:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589496323] [2025-03-04 07:29:24,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:24,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:29:24,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:29:24,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:24,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589496323] [2025-03-04 07:29:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589496323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816789129] [2025-03-04 07:29:25,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:25,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:25,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:25,088 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:29:25,090 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:29:25,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:29:25,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:29:25,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:25,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:25,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:29:25,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:25,150 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:29:25,156 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:29:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:25,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:25,372 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:29:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816789129] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:25,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:29:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2025-03-04 07:29:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175368860] [2025-03-04 07:29:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:25,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:29:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:25,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:29:25,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:29:25,374 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:25,493 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-03-04 07:29:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:29:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:29:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:25,494 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:29:25,494 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:29:25,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:29:25,495 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:25,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 107 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:29:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-04 07:29:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.5294117647058822) 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:29:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-04 07:29:25,497 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 12 [2025-03-04 07:29:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-04 07:29:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-04 07:29:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:29:25,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:25,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:25,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:25,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1504783924, now seen corresponding path program 1 times [2025-03-04 07:29:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140661146] [2025-03-04 07:29:25,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:29:25,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:29:25,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:25,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:25,743 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:29:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140661146] [2025-03-04 07:29:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140661146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:29:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410311124] [2025-03-04 07:29:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:25,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:29:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:25,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:29:25,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:29:25,744 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:25,792 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2025-03-04 07:29:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:29:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-04 07:29:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:25,793 INFO L225 Difference]: With dead ends: 41 [2025-03-04 07:29:25,793 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 07:29:25,793 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:29:25,793 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:25,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 07:29:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 07:29:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 40 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:29:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-04 07:29:25,795 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2025-03-04 07:29:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:25,795 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-04 07:29:25,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-03-04 07:29:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:29:25,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:25,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:29:25,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:25,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:25,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1504783923, now seen corresponding path program 1 times [2025-03-04 07:29:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959461572] [2025-03-04 07:29:25,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:25,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:29:25,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:29:25,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:25,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:25,882 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:29:25,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:25,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959461572] [2025-03-04 07:29:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959461572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:29:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642572784] [2025-03-04 07:29:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:25,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:29:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:25,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:29:25,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:29:25,883 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:25,961 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-04 07:29:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:29:25,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-04 07:29:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:25,961 INFO L225 Difference]: With dead ends: 55 [2025-03-04 07:29:25,961 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 07:29:25,961 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:29:25,962 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:25,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 105 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 07:29:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-03-04 07:29:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 48 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:29:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-03-04 07:29:25,963 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 13 [2025-03-04 07:29:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:25,963 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-03-04 07:29:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-03-04 07:29:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:29:25,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:25,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:25,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:29:25,964 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1306575058, now seen corresponding path program 1 times [2025-03-04 07:29:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44903049] [2025-03-04 07:29:25,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:25,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:29:25,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:29:25,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:25,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:26,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44903049] [2025-03-04 07:29:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44903049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:29:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675192442] [2025-03-04 07:29:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:29:26,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:29:26,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:29:26,056 INFO L87 Difference]: Start difference. First operand 49 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:29:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,077 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-03-04 07:29:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:29:26,077 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:29:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,077 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:29:26,077 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:29:26,077 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:29:26,078 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:29:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 07:29:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.435897435897436) internal successors, (56), 44 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:29:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-03-04 07:29:26,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 15 [2025-03-04 07:29:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,079 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-04 07:29:26,079 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:29:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2025-03-04 07:29:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:29:26,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:26,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:29:26,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1538790183, now seen corresponding path program 1 times [2025-03-04 07:29:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012415856] [2025-03-04 07:29:26,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:29:26,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:29:26,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,124 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:29:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012415856] [2025-03-04 07:29:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012415856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:29:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665341828] [2025-03-04 07:29:26,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:29:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:29:26,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:29:26,125 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,152 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2025-03-04 07:29:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:29:26,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-04 07:29:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,153 INFO L225 Difference]: With dead ends: 44 [2025-03-04 07:29:26,153 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 07:29:26,153 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:29:26,153 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 53 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 07:29:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 07:29:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-03-04 07:29:26,154 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 17 [2025-03-04 07:29:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,154 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-03-04 07:29:26,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-03-04 07:29:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:29:26,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:26,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:29:26,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1538790184, now seen corresponding path program 1 times [2025-03-04 07:29:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233058461] [2025-03-04 07:29:26,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:29:26,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:29:26,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,243 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:29:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233058461] [2025-03-04 07:29:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233058461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:29:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670216724] [2025-03-04 07:29:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:29:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:29:26,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:29:26,244 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,323 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-04 07:29:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:29:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-04 07:29:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,324 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:29:26,324 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:29:26,324 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:29:26,324 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 86 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:29:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 50. [2025-03-04 07:29:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 49 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:29:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-04 07:29:26,326 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 17 [2025-03-04 07:29:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,326 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-04 07:29:26,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-04 07:29:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:29:26,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:26,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:29:26,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:26,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1538790999, now seen corresponding path program 1 times [2025-03-04 07:29:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724842695] [2025-03-04 07:29:26,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:29:26,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:29:26,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,340 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:29:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724842695] [2025-03-04 07:29:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724842695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:29:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303300986] [2025-03-04 07:29:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:29:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:29:26,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:29:26,340 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,352 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-03-04 07:29:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:29:26,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-04 07:29:26,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,352 INFO L225 Difference]: With dead ends: 52 [2025-03-04 07:29:26,352 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 07:29:26,352 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:29:26,353 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 07:29:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 07:29:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 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:29:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-04 07:29:26,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 17 [2025-03-04 07:29:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,354 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-04 07:29:26,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-04 07:29:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:29:26,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,354 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:29:26,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:29:26,354 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:26,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1309352545, now seen corresponding path program 1 times [2025-03-04 07:29:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642858535] [2025-03-04 07:29:26,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:29:26,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:29:26,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,396 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:29:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642858535] [2025-03-04 07:29:26,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642858535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:29:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201300959] [2025-03-04 07:29:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:29:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:29:26,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:26,398 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:29:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,427 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-04 07:29:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:29:26,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:29:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,428 INFO L225 Difference]: With dead ends: 55 [2025-03-04 07:29:26,428 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 07:29:26,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:29:26,429 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 07:29:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 07:29:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 51 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:29:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-03-04 07:29:26,431 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 19 [2025-03-04 07:29:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-03-04 07:29:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:29:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-03-04 07:29:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:29:26,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:26,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:29:26,433 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1912380602, now seen corresponding path program 1 times [2025-03-04 07:29:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820403639] [2025-03-04 07:29:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:29:26,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:29:26,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,639 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:29:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820403639] [2025-03-04 07:29:26,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820403639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 07:29:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247907131] [2025-03-04 07:29:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:29:26,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:29:26,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:29:26,642 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,803 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-04 07:29:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:29:26,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:29:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,805 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:29:26,805 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:29:26,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:29:26,806 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 173 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:29:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-04 07:29:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 69 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:29:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2025-03-04 07:29:26,808 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 20 [2025-03-04 07:29:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,808 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2025-03-04 07:29:26,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2025-03-04 07:29:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:29:26,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,811 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] [2025-03-04 07:29:26,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:29:26,811 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:29:26,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash -448291836, now seen corresponding path program 1 times [2025-03-04 07:29:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318537467] [2025-03-04 07:29:26,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:29:26,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:29:26,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:26,937 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:29:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318537467] [2025-03-04 07:29:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318537467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:29:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762074453] [2025-03-04 07:29:26,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:26,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:29:26,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:26,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:29:26,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:29:26,939 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:26,976 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-03-04 07:29:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:29:26,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-04 07:29:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:26,977 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:29:26,977 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:29:26,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:29:26,977 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:26,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:29:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-04 07:29:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 53 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:29:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-03-04 07:29:26,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 22 [2025-03-04 07:29:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:26,979 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-03-04 07:29:26,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-03-04 07:29:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:29:26,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:26,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:26,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:29:26,979 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:26,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1944014046, now seen corresponding path program 1 times [2025-03-04 07:29:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313079494] [2025-03-04 07:29:26,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:26,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:29:26,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:29:26,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:26,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:27,096 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:29:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313079494] [2025-03-04 07:29:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313079494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:29:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087583316] [2025-03-04 07:29:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:27,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:29:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:27,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:29:27,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:29:27,098 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:27,160 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-03-04 07:29:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:29:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:29:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:27,161 INFO L225 Difference]: With dead ends: 62 [2025-03-04 07:29:27,161 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:29:27,161 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:29:27,162 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:27,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 179 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:29:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:29:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 07:29:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 47 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:29:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-04 07:29:27,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 23 [2025-03-04 07:29:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:27,164 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-04 07:29:27,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-04 07:29:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:29:27,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:27,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:27,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:29:27,165 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:27,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1535189821, now seen corresponding path program 1 times [2025-03-04 07:29:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:27,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426418025] [2025-03-04 07:29:27,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:27,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:29:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:29:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:27,303 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:29:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426418025] [2025-03-04 07:29:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426418025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:29:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:29:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:29:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914976908] [2025-03-04 07:29:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:29:27,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:29:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:27,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:29:27,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:29:27,304 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:27,377 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2025-03-04 07:29:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:29:27,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 07:29:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:27,378 INFO L225 Difference]: With dead ends: 59 [2025-03-04 07:29:27,378 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:29:27,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:29:27,379 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:27,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 196 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:29:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-04 07:29:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 48 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:29:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-04 07:29:27,380 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 23 [2025-03-04 07:29:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-04 07:29:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-04 07:29:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:29:27,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:27,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:29:27,381 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 923215421, now seen corresponding path program 1 times [2025-03-04 07:29:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285541272] [2025-03-04 07:29:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:29:27,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:29:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:27,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:27,536 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:29:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285541272] [2025-03-04 07:29:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285541272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:27,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598995362] [2025-03-04 07:29:27,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:27,539 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:29:27,540 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:29:27,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:29:27,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:29:27,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:27,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:27,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:29:27,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:27,699 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:29:27,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:27,792 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:29:27,809 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:29:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598995362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:27,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-03-04 07:29:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315644606] [2025-03-04 07:29:27,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:29:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:27,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:29:27,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:29:27,811 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 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:29:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:27,927 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-03-04 07:29:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:29:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 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) Word has length 26 [2025-03-04 07:29:27,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:27,928 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:29:27,928 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:29:27,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:29:27,929 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 112 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:27,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 122 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:29:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2025-03-04 07:29:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-04 07:29:27,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 26 [2025-03-04 07:29:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:27,930 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-04 07:29:27,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 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:29:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-04 07:29:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:29:27,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:27,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:27,937 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:29:28,135 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,SelfDestructingSolverStorable25 [2025-03-04 07:29:28,135 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:28,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1848258361, now seen corresponding path program 1 times [2025-03-04 07:29:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478901509] [2025-03-04 07:29:28,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:28,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:29:28,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:29:28,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:28,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:28,238 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:29:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478901509] [2025-03-04 07:29:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478901509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500156726] [2025-03-04 07:29:28,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:28,243 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:29:28,245 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:29:28,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:29:28,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:29:28,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:28,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:28,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:29:28,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:28,385 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:29:28,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:28,473 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:29:28,493 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:29:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500156726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:28,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 07:29:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039781768] [2025-03-04 07:29:28,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:29:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:28,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:29:28,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:29:28,494 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:28,628 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-03-04 07:29:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:29:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:29:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:28,633 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:29:28,633 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:29:28,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:29:28,634 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:28,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 177 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:29:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2025-03-04 07:29:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-04 07:29:28,638 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 28 [2025-03-04 07:29:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:28,638 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-04 07:29:28,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-04 07:29:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:29:28,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:28,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:28,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:28,839 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,SelfDestructingSolverStorable26 [2025-03-04 07:29:28,839 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1984999320, now seen corresponding path program 1 times [2025-03-04 07:29:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84749695] [2025-03-04 07:29:28,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:28,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:29:28,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:29:28,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:28,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:28,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84749695] [2025-03-04 07:29:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84749695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126106530] [2025-03-04 07:29:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:28,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:28,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:28,970 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:29:28,971 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:29:29,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:29:29,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:29:29,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:29,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:29,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:29:29,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:29,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:29,257 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:29:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:29,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126106530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:29,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:29,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 07:29:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770022526] [2025-03-04 07:29:29,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:29:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:29,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:29:29,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:29:29,279 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:29,435 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2025-03-04 07:29:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:29:29,436 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 07:29:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:29,436 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:29:29,436 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 07:29:29,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:29:29,437 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:29,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 156 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 07:29:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2025-03-04 07:29:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 61 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:29:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2025-03-04 07:29:29,438 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2025-03-04 07:29:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:29,438 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2025-03-04 07:29:29,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2025-03-04 07:29:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:29:29,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:29,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:29,445 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:29:29,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:29,641 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:29,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2004970058, now seen corresponding path program 2 times [2025-03-04 07:29:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:29,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317185819] [2025-03-04 07:29:29,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:29,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 07:29:29,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:29:29,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:30,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:30,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317185819] [2025-03-04 07:29:30,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317185819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:30,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846971488] [2025-03-04 07:29:30,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:30,034 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:29:30,056 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:29:30,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 07:29:30,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:29:30,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:30,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:30,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:29:30,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:30,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:29:30,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:29:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:30,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:30,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:29:30,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-04 07:29:30,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:29:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:30,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846971488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:30,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 37 [2025-03-04 07:29:30,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862509592] [2025-03-04 07:29:30,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:30,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 07:29:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:30,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 07:29:30,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1220, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:29:30,558 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 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:29:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:31,483 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2025-03-04 07:29:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 07:29:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 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 33 [2025-03-04 07:29:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:31,484 INFO L225 Difference]: With dead ends: 155 [2025-03-04 07:29:31,484 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:29:31,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=444, Invalid=4668, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 07:29:31,487 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 115 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:31,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 200 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:29:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:29:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2025-03-04 07:29:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 117 states have (on average 1.170940170940171) internal successors, (137), 119 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2025-03-04 07:29:31,489 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2025-03-04 07:29:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:31,489 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2025-03-04 07:29:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 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:29:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2025-03-04 07:29:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:29:31,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:31,489 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, 1] [2025-03-04 07:29:31,496 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:29:31,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:29:31,690 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:31,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash 578398171, now seen corresponding path program 1 times [2025-03-04 07:29:31,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:31,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347899497] [2025-03-04 07:29:31,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:31,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:29:31,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:29:31,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:31,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:29:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347899497] [2025-03-04 07:29:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347899497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823888247] [2025-03-04 07:29:31,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:31,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:31,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:31,790 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:29:31,791 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:29:31,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:29:31,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:29:31,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:31,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:31,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:29:31,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:31,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:32,084 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:29:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823888247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:32,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-03-04 07:29:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006969557] [2025-03-04 07:29:32,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:32,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:29:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:32,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:29:32,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:29:32,105 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 17 states, 16 states have (on average 4.9375) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:32,331 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2025-03-04 07:29:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:29:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-04 07:29:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:32,332 INFO L225 Difference]: With dead ends: 124 [2025-03-04 07:29:32,333 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 07:29:32,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:29:32,334 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:32,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 198 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 07:29:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-03-04 07:29:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 117 states have (on average 1.1538461538461537) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2025-03-04 07:29:32,341 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 34 [2025-03-04 07:29:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:32,341 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2025-03-04 07:29:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2025-03-04 07:29:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:29:32,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:32,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:32,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:29:32,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:32,542 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:29:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash -304742607, now seen corresponding path program 2 times [2025-03-04 07:29:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830222696] [2025-03-04 07:29:32,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:32,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 07:29:32,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:29:32,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830222696] [2025-03-04 07:29:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830222696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258896712] [2025-03-04 07:29:32,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:32,785 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:29:32,787 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:29:32,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 07:29:32,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:29:32,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:32,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:29:32,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:32,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:29:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:32,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:33,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-04 07:29:33,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:29:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258896712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:33,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:33,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-03-04 07:29:33,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243708135] [2025-03-04 07:29:33,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:33,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:29:33,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:33,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:29:33,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:29:33,129 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 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:29:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:33,254 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2025-03-04 07:29:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:29:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 07:29:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:33,255 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:29:33,255 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 07:29:33,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:29:33,256 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:33,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 342 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 07:29:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-04 07:29:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2025-03-04 07:29:33,258 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 39 [2025-03-04 07:29:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:33,258 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2025-03-04 07:29:33,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 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:29:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2025-03-04 07:29:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:29:33,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:33,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:33,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:33,463 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,SelfDestructingSolverStorable30 [2025-03-04 07:29:33,463 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash -429059636, now seen corresponding path program 3 times [2025-03-04 07:29:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814188055] [2025-03-04 07:29:33,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:33,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-03-04 07:29:33,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:29:33,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:29:33,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814188055] [2025-03-04 07:29:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814188055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799401545] [2025-03-04 07:29:33,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:33,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:33,655 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:29:33,657 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:29:33,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-03-04 07:29:33,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:29:33,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:29:33,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:33,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:29:33,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:33,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:33,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:29:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799401545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:33,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-03-04 07:29:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12270569] [2025-03-04 07:29:33,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:29:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:29:33,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:29:33,984 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:34,228 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-03-04 07:29:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:29:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 07:29:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:34,229 INFO L225 Difference]: With dead ends: 125 [2025-03-04 07:29:34,229 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 07:29:34,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 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:29:34,229 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:34,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 298 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:29:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 07:29:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2025-03-04 07:29:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2025-03-04 07:29:34,236 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 39 [2025-03-04 07:29:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:34,236 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2025-03-04 07:29:34,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2025-03-04 07:29:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:29:34,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:34,236 INFO L218 NwaCegarLoop]: trace histogram [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:29:34,243 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:29:34,436 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,SelfDestructingSolverStorable31 [2025-03-04 07:29:34,437 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:34,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1214696593, now seen corresponding path program 3 times [2025-03-04 07:29:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:34,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858117152] [2025-03-04 07:29:34,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:34,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-03-04 07:29:34,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:29:34,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:29:34,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858117152] [2025-03-04 07:29:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858117152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240440125] [2025-03-04 07:29:34,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:34,702 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:29:34,703 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:29:34,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-03-04 07:29:34,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:29:34,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:29:34,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:34,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:29:34,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:34,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:35,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:29:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:29:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240440125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:35,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:35,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 07:29:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350883571] [2025-03-04 07:29:35,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:35,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:29:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:35,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:29:35,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:29:35,066 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:35,258 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2025-03-04 07:29:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:29:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-04 07:29:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:35,259 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:29:35,259 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:29:35,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:29:35,260 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:35,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 193 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:29:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2025-03-04 07:29:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 140 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2025-03-04 07:29:35,262 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 42 [2025-03-04 07:29:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:35,262 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2025-03-04 07:29:35,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.545454545454546) internal successors, (100), 23 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2025-03-04 07:29:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:29:35,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:35,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:35,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:35,467 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,SelfDestructingSolverStorable32 [2025-03-04 07:29:35,467 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -492291161, now seen corresponding path program 2 times [2025-03-04 07:29:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929102320] [2025-03-04 07:29:35,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:35,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 07:29:35,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:29:35,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:35,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929102320] [2025-03-04 07:29:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929102320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471380922] [2025-03-04 07:29:35,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:35,728 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:29:35,729 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:29:35,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 07:29:35,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:29:35,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:35,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:35,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:29:35,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:35,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:36,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-04 07:29:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471380922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:36,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-04 07:29:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875842335] [2025-03-04 07:29:36,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:36,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:29:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:36,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:29:36,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:29:36,144 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:36,342 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-03-04 07:29:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:29:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-04 07:29:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:36,343 INFO L225 Difference]: With dead ends: 155 [2025-03-04 07:29:36,343 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 07:29:36,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:29:36,343 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:36,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 217 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 07:29:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2025-03-04 07:29:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 142 states have (on average 1.1619718309859155) internal successors, (165), 144 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2025-03-04 07:29:36,345 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 43 [2025-03-04 07:29:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:36,345 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2025-03-04 07:29:36,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2025-03-04 07:29:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:29:36,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:36,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:36,352 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:29:36,546 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,SelfDestructingSolverStorable33 [2025-03-04 07:29:36,547 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1467297755, now seen corresponding path program 4 times [2025-03-04 07:29:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:36,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247411509] [2025-03-04 07:29:36,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:36,554 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-04 07:29:36,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 46 statements. [2025-03-04 07:29:36,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:36,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247411509] [2025-03-04 07:29:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247411509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033182624] [2025-03-04 07:29:36,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:36,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:36,955 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:29:36,956 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:29:37,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-04 07:29:37,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 40 of 46 statements. [2025-03-04 07:29:37,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:37,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:37,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 07:29:37,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:37,089 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:29:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:37,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:37,369 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:29:37,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:29:37,374 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:29:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033182624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:37,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-03-04 07:29:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286673588] [2025-03-04 07:29:37,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:37,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:29:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:37,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:29:37,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:29:37,484 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:37,756 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2025-03-04 07:29:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:29:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-04 07:29:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:37,757 INFO L225 Difference]: With dead ends: 222 [2025-03-04 07:29:37,757 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 07:29:37,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1861, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:29:37,758 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:37,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 208 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:29:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 07:29:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2025-03-04 07:29:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 203 states have (on average 1.1477832512315271) internal successors, (233), 205 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2025-03-04 07:29:37,763 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 46 [2025-03-04 07:29:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:37,764 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2025-03-04 07:29:37,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2025-03-04 07:29:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:29:37,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:37,764 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-04 07:29:37,771 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:29:37,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:37,965 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:37,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 370405636, now seen corresponding path program 1 times [2025-03-04 07:29:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:37,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499469473] [2025-03-04 07:29:37,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:37,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:29:37,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:29:37,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:37,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499469473] [2025-03-04 07:29:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499469473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367942594] [2025-03-04 07:29:38,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:29:38,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:38,135 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:29:38,137 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:29:38,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:29:38,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:29:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:29:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:38,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:29:38,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:38,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:38,494 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:29:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:38,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367942594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:38,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:38,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2025-03-04 07:29:38,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579121619] [2025-03-04 07:29:38,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:29:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:38,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:29:38,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:29:38,535 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:38,762 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2025-03-04 07:29:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:29:38,763 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-04 07:29:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:38,763 INFO L225 Difference]: With dead ends: 220 [2025-03-04 07:29:38,763 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 07:29:38,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:29:38,764 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 67 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:38,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:29:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 07:29:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 206. [2025-03-04 07:29:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 203 states have (on average 1.1379310344827587) internal successors, (231), 205 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2025-03-04 07:29:38,767 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 47 [2025-03-04 07:29:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:38,768 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2025-03-04 07:29:38,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2025-03-04 07:29:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:29:38,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:38,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:38,774 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:29:38,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:38,969 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 418117535, now seen corresponding path program 5 times [2025-03-04 07:29:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754438656] [2025-03-04 07:29:38,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:29:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:38,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-03-04 07:29:38,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:29:38,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:29:38,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:39,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754438656] [2025-03-04 07:29:39,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754438656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637318775] [2025-03-04 07:29:39,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:29:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:39,135 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:29:39,136 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:29:39,191 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-03-04 07:29:39,212 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 07:29:39,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 07:29:39,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:39,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:29:39,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:39,220 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:29:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:39,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637318775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:39,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:39,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-04 07:29:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659283985] [2025-03-04 07:29:39,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:39,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:29:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:39,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:29:39,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:29:39,624 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand has 31 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 31 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:39,875 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2025-03-04 07:29:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:29:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 31 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-04 07:29:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:39,876 INFO L225 Difference]: With dead ends: 258 [2025-03-04 07:29:39,876 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 07:29:39,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:29:39,876 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 191 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:39,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 380 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:29:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 07:29:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 223. [2025-03-04 07:29:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 220 states have (on average 1.15) internal successors, (253), 222 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2025-03-04 07:29:39,880 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 49 [2025-03-04 07:29:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:39,880 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2025-03-04 07:29:39,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 31 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2025-03-04 07:29:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:29:39,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:39,880 INFO L218 NwaCegarLoop]: trace histogram [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:29:39,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:29:40,081 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,SelfDestructingSolverStorable36 [2025-03-04 07:29:40,081 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1374297207, now seen corresponding path program 4 times [2025-03-04 07:29:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488153257] [2025-03-04 07:29:40,082 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:40,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-04 07:29:40,099 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 48 of 53 statements. [2025-03-04 07:29:40,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:40,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:29:40,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488153257] [2025-03-04 07:29:40,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488153257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742826184] [2025-03-04 07:29:40,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:40,461 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:29:40,462 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:29:40,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-04 07:29:40,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 48 of 53 statements. [2025-03-04 07:29:40,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:40,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:40,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 07:29:40,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:40,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 07:29:41,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:29:41,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 122 [2025-03-04 07:29:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:29:41,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:42,199 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:29:42,204 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 68 treesize of output 58 [2025-03-04 07:29:42,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:29:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:29:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742826184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:42,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:42,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34 [2025-03-04 07:29:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430677221] [2025-03-04 07:29:42,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:42,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:29:42,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:42,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:29:42,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:29:42,237 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 35 states, 34 states have (on average 3.5) internal successors, (119), 35 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:29:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:42,754 INFO L93 Difference]: Finished difference Result 295 states and 327 transitions. [2025-03-04 07:29:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:29:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.5) internal successors, (119), 35 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 53 [2025-03-04 07:29:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:42,756 INFO L225 Difference]: With dead ends: 295 [2025-03-04 07:29:42,756 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 07:29:42,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=1207, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:29:42,757 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:42,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 265 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:29:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 07:29:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 160. [2025-03-04 07:29:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 1.1455696202531647) internal successors, (181), 159 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2025-03-04 07:29:42,760 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 53 [2025-03-04 07:29:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2025-03-04 07:29:42,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.5) internal successors, (119), 35 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:29:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2025-03-04 07:29:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:29:42,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:42,760 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:42,767 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:29:42,961 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,SelfDestructingSolverStorable37 [2025-03-04 07:29:42,961 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:42,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1288306682, now seen corresponding path program 3 times [2025-03-04 07:29:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:42,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933939140] [2025-03-04 07:29:42,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:42,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:42,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-03-04 07:29:42,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:29:42,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 07:29:42,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933939140] [2025-03-04 07:29:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933939140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165468867] [2025-03-04 07:29:43,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:43,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:43,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:43,269 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:29:43,270 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:29:43,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 4 equivalence classes. [2025-03-04 07:29:43,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:29:43,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 07:29:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:43,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-04 07:29:43,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:43,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:29:43,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:29:43,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:29:43,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:29:43,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:29:43,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2025-03-04 07:29:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:29:44,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:44,251 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 22 treesize of output 20 [2025-03-04 07:29:44,252 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 34 treesize of output 30 [2025-03-04 07:29:44,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:29:44,291 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 77 treesize of output 69 [2025-03-04 07:29:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165468867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:44,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 21] total 52 [2025-03-04 07:29:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277396291] [2025-03-04 07:29:44,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:44,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 07:29:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:44,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 07:29:44,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2441, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 07:29:44,417 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:45,292 INFO L93 Difference]: Finished difference Result 232 states and 259 transitions. [2025-03-04 07:29:45,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 07:29:45,292 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-04 07:29:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:45,293 INFO L225 Difference]: With dead ends: 232 [2025-03-04 07:29:45,293 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 07:29:45,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=373, Invalid=4049, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 07:29:45,294 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:45,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 582 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:29:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 07:29:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 199. [2025-03-04 07:29:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 1.1421319796954315) internal successors, (225), 198 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2025-03-04 07:29:45,297 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 53 [2025-03-04 07:29:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:45,297 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2025-03-04 07:29:45,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.423076923076923) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2025-03-04 07:29:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:29:45,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:45,298 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:45,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:29:45,498 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,SelfDestructingSolverStorable38 [2025-03-04 07:29:45,498 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1710886984, now seen corresponding path program 4 times [2025-03-04 07:29:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:45,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710410031] [2025-03-04 07:29:45,499 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:45,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:29:45,510 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:29:45,510 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:45,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710410031] [2025-03-04 07:29:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710410031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672395341] [2025-03-04 07:29:46,115 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:46,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:46,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:46,118 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:29:46,119 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:29:46,186 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-04 07:29:46,207 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:29:46,208 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:46,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:46,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 07:29:46,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:46,333 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:29:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:46,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:46,796 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 59 treesize of output 51 [2025-03-04 07:29:46,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:29:46,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 45 [2025-03-04 07:29:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:46,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672395341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:46,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:46,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2025-03-04 07:29:46,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562250770] [2025-03-04 07:29:46,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:46,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 07:29:46,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:46,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 07:29:46,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:29:46,966 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 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:29:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:47,453 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2025-03-04 07:29:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 07:29:47,453 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 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 56 [2025-03-04 07:29:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:47,454 INFO L225 Difference]: With dead ends: 316 [2025-03-04 07:29:47,454 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 07:29:47,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=3283, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 07:29:47,455 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:47,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 302 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:29:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 07:29:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 272. [2025-03-04 07:29:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 1.137037037037037) internal successors, (307), 271 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 307 transitions. [2025-03-04 07:29:47,459 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 307 transitions. Word has length 56 [2025-03-04 07:29:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 307 transitions. [2025-03-04 07:29:47,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 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:29:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 307 transitions. [2025-03-04 07:29:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:29:47,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:47,460 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:47,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 07:29:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 07:29:47,664 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -114985475, now seen corresponding path program 2 times [2025-03-04 07:29:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406692918] [2025-03-04 07:29:47,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:47,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-04 07:29:47,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:29:47,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:48,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:48,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406692918] [2025-03-04 07:29:48,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406692918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:48,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433804191] [2025-03-04 07:29:48,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:29:48,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:48,022 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:29:48,023 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:29:48,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-04 07:29:48,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:29:48,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:29:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:48,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:29:48,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:48,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:29:48,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:29:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:48,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:48,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:29:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-04 07:29:48,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:29:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:48,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433804191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:48,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:48,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 41 [2025-03-04 07:29:48,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181850798] [2025-03-04 07:29:48,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 07:29:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:48,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 07:29:48,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 07:29:48,543 INFO L87 Difference]: Start difference. First operand 272 states and 307 transitions. Second operand has 41 states, 41 states have (on average 2.5121951219512195) internal successors, (103), 41 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:48,990 INFO L93 Difference]: Finished difference Result 385 states and 426 transitions. [2025-03-04 07:29:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:29:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5121951219512195) internal successors, (103), 41 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-04 07:29:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:48,991 INFO L225 Difference]: With dead ends: 385 [2025-03-04 07:29:48,991 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 07:29:48,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=2492, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 07:29:48,992 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:48,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 440 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:29:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 07:29:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 332. [2025-03-04 07:29:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 330 states have (on average 1.1242424242424243) internal successors, (371), 331 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 371 transitions. [2025-03-04 07:29:48,997 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 371 transitions. Word has length 57 [2025-03-04 07:29:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:48,997 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 371 transitions. [2025-03-04 07:29:48,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5121951219512195) internal successors, (103), 41 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 371 transitions. [2025-03-04 07:29:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:29:48,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:48,998 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:49,005 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:29:49,202 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,SelfDestructingSolverStorable40 [2025-03-04 07:29:49,202 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash 625659542, now seen corresponding path program 3 times [2025-03-04 07:29:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858957183] [2025-03-04 07:29:49,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:49,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 3 equivalence classes. [2025-03-04 07:29:49,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:29:49,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:29:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858957183] [2025-03-04 07:29:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858957183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297154685] [2025-03-04 07:29:49,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:29:49,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:49,493 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:29:49,495 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:29:49,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 3 equivalence classes. [2025-03-04 07:29:49,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:29:49,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:29:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:49,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 07:29:49,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:49,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:29:49,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:29:50,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:29:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:50,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:50,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-03-04 07:29:50,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-04 07:29:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:29:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:29:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297154685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:50,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 49 [2025-03-04 07:29:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332105561] [2025-03-04 07:29:50,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:50,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:29:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:50,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:29:50,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:29:50,384 INFO L87 Difference]: Start difference. First operand 332 states and 371 transitions. Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:50,842 INFO L93 Difference]: Finished difference Result 415 states and 456 transitions. [2025-03-04 07:29:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:29:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 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 58 [2025-03-04 07:29:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:50,843 INFO L225 Difference]: With dead ends: 415 [2025-03-04 07:29:50,843 INFO L226 Difference]: Without dead ends: 415 [2025-03-04 07:29:50,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=2819, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 07:29:50,844 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:50,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 556 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:29:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-04 07:29:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 395. [2025-03-04 07:29:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 393 states have (on average 1.10941475826972) internal successors, (436), 394 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 436 transitions. [2025-03-04 07:29:50,855 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 436 transitions. Word has length 58 [2025-03-04 07:29:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 436 transitions. [2025-03-04 07:29:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 436 transitions. [2025-03-04 07:29:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 07:29:50,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:50,856 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:50,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:51,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:51,056 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:51,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2126234424, now seen corresponding path program 5 times [2025-03-04 07:29:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884525480] [2025-03-04 07:29:51,057 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:29:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:51,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 5 equivalence classes. [2025-03-04 07:29:51,074 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:29:51,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 07:29:51,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:29:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884525480] [2025-03-04 07:29:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884525480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839194682] [2025-03-04 07:29:51,251 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:29:51,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:51,254 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:29:51,255 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:29:51,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 5 equivalence classes. [2025-03-04 07:29:51,366 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:29:51,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 07:29:51,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:51,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:29:51,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:29:51,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:51,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-04 07:29:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:29:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839194682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:51,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-03-04 07:29:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234255881] [2025-03-04 07:29:51,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:51,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:29:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:51,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:29:51,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:29:51,823 INFO L87 Difference]: Start difference. First operand 395 states and 436 transitions. Second operand has 29 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:52,168 INFO L93 Difference]: Finished difference Result 417 states and 457 transitions. [2025-03-04 07:29:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:29:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-04 07:29:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:52,169 INFO L225 Difference]: With dead ends: 417 [2025-03-04 07:29:52,169 INFO L226 Difference]: Without dead ends: 417 [2025-03-04 07:29:52,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:29:52,170 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:52,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 496 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:29:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-04 07:29:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 399. [2025-03-04 07:29:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 1.1083123425692696) internal successors, (440), 398 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 440 transitions. [2025-03-04 07:29:52,175 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 440 transitions. Word has length 59 [2025-03-04 07:29:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:52,175 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 440 transitions. [2025-03-04 07:29:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 440 transitions. [2025-03-04 07:29:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:29:52,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:52,176 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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:29:52,184 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:29:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:52,377 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:52,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1665619643, now seen corresponding path program 4 times [2025-03-04 07:29:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:52,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129941598] [2025-03-04 07:29:52,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:52,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-03-04 07:29:52,400 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 52 of 60 statements. [2025-03-04 07:29:52,401 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:52,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:29:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129941598] [2025-03-04 07:29:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129941598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458720371] [2025-03-04 07:29:53,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:29:53,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:53,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:53,057 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:29:53,059 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:29:53,134 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-03-04 07:29:53,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 52 of 60 statements. [2025-03-04 07:29:53,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:29:53,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:53,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 07:29:53,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:53,188 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:29:54,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:29:54,171 INFO L349 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2025-03-04 07:29:54,172 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 38 treesize of output 40 [2025-03-04 07:29:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:29:54,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:29:54,907 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:29:54,911 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 68 treesize of output 58 [2025-03-04 07:29:54,915 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:29:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:29:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458720371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:54,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 51 [2025-03-04 07:29:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318099796] [2025-03-04 07:29:54,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:54,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 07:29:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:54,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 07:29:54,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2405, Unknown=1, NotChecked=0, Total=2652 [2025-03-04 07:29:54,936 INFO L87 Difference]: Start difference. First operand 399 states and 440 transitions. Second operand has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 52 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:56,920 INFO L93 Difference]: Finished difference Result 456 states and 491 transitions. [2025-03-04 07:29:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 07:29:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 52 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-04 07:29:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:56,921 INFO L225 Difference]: With dead ends: 456 [2025-03-04 07:29:56,921 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 07:29:56,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1127, Invalid=5844, Unknown=1, NotChecked=0, Total=6972 [2025-03-04 07:29:56,923 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 236 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:56,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 271 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:29:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 07:29:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 138. [2025-03-04 07:29:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.1029411764705883) internal successors, (150), 137 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:29:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-03-04 07:29:56,925 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 60 [2025-03-04 07:29:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:56,925 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-03-04 07:29:56,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 52 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-03-04 07:29:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 07:29:56,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:56,926 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:56,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 07:29:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:57,127 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:57,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 472003242, now seen corresponding path program 6 times [2025-03-04 07:29:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091287388] [2025-03-04 07:29:57,127 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:29:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:57,135 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 5 equivalence classes. [2025-03-04 07:29:57,145 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 07:29:57,145 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:29:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091287388] [2025-03-04 07:29:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091287388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:57,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372327846] [2025-03-04 07:29:57,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:29:57,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:57,419 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:29:57,420 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:29:57,494 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 62 statements into 5 equivalence classes. [2025-03-04 07:29:57,532 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 07:29:57,532 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:29:57,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:57,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:29:57,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:57,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:57,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:29:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372327846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:57,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2025-03-04 07:29:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880318768] [2025-03-04 07:29:57,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:29:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:57,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:29:57,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:29:57,916 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 32 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 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:29:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:29:58,175 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2025-03-04 07:29:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:29:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 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 62 [2025-03-04 07:29:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:29:58,176 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:29:58,176 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:29:58,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:29:58,176 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 191 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:29:58,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 252 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:29:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:29:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2025-03-04 07:29:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 139 states have (on average 1.1079136690647482) internal successors, (154), 140 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:29:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2025-03-04 07:29:58,178 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 62 [2025-03-04 07:29:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:29:58,179 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2025-03-04 07:29:58,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 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:29:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2025-03-04 07:29:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:29:58,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:29:58,179 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:29:58,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 07:29:58,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:58,385 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:29:58,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:29:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash 84262277, now seen corresponding path program 6 times [2025-03-04 07:29:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:29:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606495882] [2025-03-04 07:29:58,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:29:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:29:58,392 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 5 equivalence classes. [2025-03-04 07:29:58,423 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:29:58,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:29:58,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 76 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:29:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:29:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606495882] [2025-03-04 07:29:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606495882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:29:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330891980] [2025-03-04 07:29:58,752 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:29:58,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:29:58,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:29:58,754 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:29:58,755 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:29:58,827 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 5 equivalence classes. [2025-03-04 07:29:58,874 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:29:58,874 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 07:29:58,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:29:58,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:29:58,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:29:58,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:29:59,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:29:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:29:59,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:29:59,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-04 07:29:59,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-04 07:29:59,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:29:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 54 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:29:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330891980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:29:59,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:29:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 43 [2025-03-04 07:29:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023769799] [2025-03-04 07:29:59,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:29:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 07:29:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:29:59,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 07:29:59,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1691, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:29:59,349 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 43 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:01,107 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2025-03-04 07:30:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 07:30:01,108 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 43 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 07:30:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:01,108 INFO L225 Difference]: With dead ends: 355 [2025-03-04 07:30:01,108 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 07:30:01,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=549, Invalid=8381, Unknown=0, NotChecked=0, Total=8930 [2025-03-04 07:30:01,110 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 168 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 3351 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:01,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1151 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3351 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:30:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 07:30:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 192. [2025-03-04 07:30:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.105263157894737) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2025-03-04 07:30:01,113 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 66 [2025-03-04 07:30:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:01,113 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2025-03-04 07:30:01,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 43 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2025-03-04 07:30:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 07:30:01,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:01,114 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:30:01,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 07:30:01,314 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,SelfDestructingSolverStorable45 [2025-03-04 07:30:01,315 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:30:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 683271363, now seen corresponding path program 7 times [2025-03-04 07:30:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940760897] [2025-03-04 07:30:01,316 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:30:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 07:30:01,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:30:01,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:01,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 5 proven. 79 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 07:30:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940760897] [2025-03-04 07:30:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940760897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:30:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862694670] [2025-03-04 07:30:01,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:30:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:30:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:30:01,573 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:30:01,575 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:30:01,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 07:30:01,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:30:01,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:01,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:01,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:30:01,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:30:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 07:30:01,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:30:02,059 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:30:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 07:30:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862694670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:30:02,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:30:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 30 [2025-03-04 07:30:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158623898] [2025-03-04 07:30:02,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:30:02,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:30:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:02,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:30:02,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:30:02,116 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:02,409 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2025-03-04 07:30:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:30:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 states have internal predecessors, (128), 0 states have call successors, (0), 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:30:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:02,410 INFO L225 Difference]: With dead ends: 250 [2025-03-04 07:30:02,410 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 07:30:02,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:30:02,411 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 145 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:02,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 389 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:30:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 07:30:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 227. [2025-03-04 07:30:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.1066666666666667) internal successors, (249), 226 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2025-03-04 07:30:02,413 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 72 [2025-03-04 07:30:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2025-03-04 07:30:02,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2025-03-04 07:30:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 07:30:02,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:02,414 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:30:02,421 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:30:02,614 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,SelfDestructingSolverStorable46 [2025-03-04 07:30:02,615 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:30:02,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1487118655, now seen corresponding path program 7 times [2025-03-04 07:30:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794238537] [2025-03-04 07:30:02,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:30:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:02,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 07:30:02,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:30:02,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:02,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 98 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:30:02,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794238537] [2025-03-04 07:30:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794238537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:30:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568643678] [2025-03-04 07:30:02,929 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 07:30:02,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:30:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:30:02,933 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:30:02,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 07:30:03,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 07:30:03,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:30:03,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:03,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 07:30:03,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:30:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 22 proven. 88 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:30:03,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:30:03,418 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:30:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 22 proven. 88 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:30:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568643678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:30:03,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:30:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 35 [2025-03-04 07:30:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318946756] [2025-03-04 07:30:03,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:30:03,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:30:03,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:03,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:30:03,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:30:03,487 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand has 36 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 36 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:03,817 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2025-03-04 07:30:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:30:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 36 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-04 07:30:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:03,819 INFO L225 Difference]: With dead ends: 258 [2025-03-04 07:30:03,819 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 07:30:03,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1657, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:30:03,819 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 173 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:03,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 486 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:30:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 07:30:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2025-03-04 07:30:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 232 states have (on average 1.1120689655172413) internal successors, (258), 233 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 258 transitions. [2025-03-04 07:30:03,822 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 258 transitions. Word has length 75 [2025-03-04 07:30:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:03,823 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 258 transitions. [2025-03-04 07:30:03,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 36 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 258 transitions. [2025-03-04 07:30:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 07:30:03,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:03,823 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:30:03,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 07:30:04,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 07:30:04,024 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:30:04,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash 794024346, now seen corresponding path program 8 times [2025-03-04 07:30:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766780599] [2025-03-04 07:30:04,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:30:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:04,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 07:30:04,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 07:30:04,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:30:04,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 5 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:30:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:05,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766780599] [2025-03-04 07:30:05,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766780599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:30:05,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932610565] [2025-03-04 07:30:05,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:30:05,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:30:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:30:05,464 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:30:05,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 07:30:05,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 07:30:05,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 07:30:05,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:30:05,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:05,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:30:05,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:30:05,814 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:30:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 10 proven. 120 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:30:06,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:30:06,183 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:30:06,184 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:30:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 10 proven. 120 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:30:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932610565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:30:06,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:30:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 20] total 47 [2025-03-04 07:30:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126848472] [2025-03-04 07:30:06,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:30:06,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 07:30:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:06,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 07:30:06,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2055, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:30:06,268 INFO L87 Difference]: Start difference. First operand 234 states and 258 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:08,811 INFO L93 Difference]: Finished difference Result 436 states and 477 transitions. [2025-03-04 07:30:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 07:30:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 07:30:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:08,813 INFO L225 Difference]: With dead ends: 436 [2025-03-04 07:30:08,813 INFO L226 Difference]: Without dead ends: 430 [2025-03-04 07:30:08,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=345, Invalid=6627, Unknown=0, NotChecked=0, Total=6972 [2025-03-04 07:30:08,814 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 164 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:08,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1429 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 07:30:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-04 07:30:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 373. [2025-03-04 07:30:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 371 states have (on average 1.110512129380054) internal successors, (412), 372 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 412 transitions. [2025-03-04 07:30:08,817 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 412 transitions. Word has length 79 [2025-03-04 07:30:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:08,817 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 412 transitions. [2025-03-04 07:30:08,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 412 transitions. [2025-03-04 07:30:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:30:08,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:08,818 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:30:08,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 07:30:09,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:30:09,019 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-04 07:30:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1928330021, now seen corresponding path program 5 times [2025-03-04 07:30:09,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266181955] [2025-03-04 07:30:09,019 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:30:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:09,027 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 6 equivalence classes. [2025-03-04 07:30:09,036 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:30:09,037 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 07:30:09,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 07:30:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266181955] [2025-03-04 07:30:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266181955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:30:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687952995] [2025-03-04 07:30:09,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:30:09,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:30:09,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:30:09,524 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:30:09,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 07:30:09,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 6 equivalence classes. [2025-03-04 07:30:09,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:30:09,645 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 07:30:09,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:09,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-04 07:30:09,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:30:09,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:30:09,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:30:09,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:30:09,928 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:30:09,954 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:30:10,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:30:10,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:30:10,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2025-03-04 07:30:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 89 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:30:10,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:30:11,005 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 22 treesize of output 20 [2025-03-04 07:30:11,007 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 34 treesize of output 30