./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:31:01,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:31:01,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:31:01,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:31:01,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:31:01,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:31:01,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:31:01,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:31:01,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:31:01,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:31:01,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:31:01,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:31:01,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:31:01,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:31:01,988 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:31:01,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:31:01,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:31:01,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:31:01,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:31:01,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:31:01,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:31:01,990 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc [2025-01-09 22:31:02,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:31:02,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:31:02,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:31:02,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:31:02,290 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:31:02,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2025-01-09 22:31:03,643 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d964fb55a/8446b283a7c74fd3beadbfd054bf800d/FLAG8dcd18acc [2025-01-09 22:31:04,071 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:31:04,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2025-01-09 22:31:04,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d964fb55a/8446b283a7c74fd3beadbfd054bf800d/FLAG8dcd18acc [2025-01-09 22:31:04,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d964fb55a/8446b283a7c74fd3beadbfd054bf800d [2025-01-09 22:31:04,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:31:04,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:31:04,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:31:04,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:31:04,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:31:04,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2358ea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04, skipping insertion in model container [2025-01-09 22:31:04,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:31:04,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:31:04,432 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:31:04,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:31:04,504 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:31:04,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04 WrapperNode [2025-01-09 22:31:04,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:31:04,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:31:04,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:31:04,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:31:04,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,536 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 92 [2025-01-09 22:31:04,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:31:04,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:31:04,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:31:04,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:31:04,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,568 INFO L175 MemorySlicer]: Split 20 memory accesses to 1 slices as follows [20]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2025-01-09 22:31:04,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:31:04,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:31:04,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:31:04,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:31:04,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (1/1) ... [2025-01-09 22:31:04,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:31:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:04,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:31:04,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:31:04,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:31:04,640 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:31:04,640 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:31:04,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:31:04,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:31:04,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:31:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:31:04,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:31:04,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:31:04,754 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:31:04,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:31:05,122 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-01-09 22:31:05,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:31:05,134 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:31:05,134 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:31:05,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:31:05 BoogieIcfgContainer [2025-01-09 22:31:05,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:31:05,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:31:05,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:31:05,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:31:05,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:31:04" (1/3) ... [2025-01-09 22:31:05,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723cc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:31:05, skipping insertion in model container [2025-01-09 22:31:05,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:31:04" (2/3) ... [2025-01-09 22:31:05,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723cc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:31:05, skipping insertion in model container [2025-01-09 22:31:05,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:31:05" (3/3) ... [2025-01-09 22:31:05,145 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2025-01-09 22:31:05,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:31:05,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-middle-shared.i that has 2 procedures, 111 locations, 1 initial locations, 3 loop locations, and 50 error locations. [2025-01-09 22:31:05,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:31:05,205 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;@6ee9e824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:31:05,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 22:31:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 107 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:31:05,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:31:05,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:05,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash 37403083, now seen corresponding path program 1 times [2025-01-09 22:31:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804542128] [2025-01-09 22:31:05,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:31:05,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:31:05,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804542128] [2025-01-09 22:31:05,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804542128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:05,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:05,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967853507] [2025-01-09 22:31:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:05,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:05,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:05,480 INFO L87 Difference]: Start difference. First operand has 111 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 107 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:05,624 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2025-01-09 22:31:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:05,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:31:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:05,633 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:31:05,634 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:31:05,637 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-01-09 22:31:05,640 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 167 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-01-09 22:31:05,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 167 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:31:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-09 22:31:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 103 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2025-01-09 22:31:05,674 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 5 [2025-01-09 22:31:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:05,674 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2025-01-09 22:31:05,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2025-01-09 22:31:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:31:05,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:31:05,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:31:05,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:05,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash 37403084, now seen corresponding path program 1 times [2025-01-09 22:31:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386887639] [2025-01-09 22:31:05,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:31:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:31:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:05,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386887639] [2025-01-09 22:31:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386887639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512289759] [2025-01-09 22:31:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:05,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:05,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:05,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:05,805 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:05,890 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2025-01-09 22:31:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:31:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:05,892 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:31:05,892 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:31:05,892 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-01-09 22:31:05,893 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:05,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:31:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-09 22:31:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 56 states have (on average 1.875) internal successors, (105), 101 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2025-01-09 22:31:05,900 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 5 [2025-01-09 22:31:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:05,900 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2025-01-09 22:31:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:31:05,901 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2025-01-09 22:31:05,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:31:05,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:05,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:05,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:31:05,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:05,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash 343045941, now seen corresponding path program 1 times [2025-01-09 22:31:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:05,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733252933] [2025-01-09 22:31:05,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:05,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:31:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:31:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:06,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733252933] [2025-01-09 22:31:06,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733252933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:06,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:06,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:06,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881303293] [2025-01-09 22:31:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:06,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:06,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:06,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:06,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:06,040 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:06,141 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2025-01-09 22:31:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:06,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 22:31:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:06,146 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:31:06,146 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:31:06,146 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-01-09 22:31:06,147 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:06,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:31:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2025-01-09 22:31:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 100 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2025-01-09 22:31:06,166 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 11 [2025-01-09 22:31:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:06,167 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2025-01-09 22:31:06,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2025-01-09 22:31:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:31:06,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:06,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:06,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:31:06,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:06,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash 343045940, now seen corresponding path program 1 times [2025-01-09 22:31:06,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:06,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214106773] [2025-01-09 22:31:06,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:06,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:31:06,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:31:06,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:06,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:06,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214106773] [2025-01-09 22:31:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214106773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:06,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:06,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512903889] [2025-01-09 22:31:06,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:06,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:06,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:06,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:06,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:06,274 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:06,355 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2025-01-09 22:31:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:06,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-09 22:31:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:06,357 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:31:06,357 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:31:06,357 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-01-09 22:31:06,357 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:06,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 150 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:31:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-01-09 22:31:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 99 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2025-01-09 22:31:06,368 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 11 [2025-01-09 22:31:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:06,370 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2025-01-09 22:31:06,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2025-01-09 22:31:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:31:06,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:06,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:06,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:31:06,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:06,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1045333867, now seen corresponding path program 1 times [2025-01-09 22:31:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021224732] [2025-01-09 22:31:06,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:06,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:31:06,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:31:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021224732] [2025-01-09 22:31:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021224732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:06,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263881365] [2025-01-09 22:31:06,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:06,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:06,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:06,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:06,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:06,478 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:06,560 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2025-01-09 22:31:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:31:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:06,562 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:31:06,562 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:31:06,563 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-01-09 22:31:06,564 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:06,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:31:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-01-09 22:31:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 98 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2025-01-09 22:31:06,574 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 13 [2025-01-09 22:31:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:06,575 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2025-01-09 22:31:06,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2025-01-09 22:31:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:31:06,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:06,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:06,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:31:06,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:06,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1045333866, now seen corresponding path program 1 times [2025-01-09 22:31:06,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:06,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523250846] [2025-01-09 22:31:06,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:06,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:31:06,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:31:06,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523250846] [2025-01-09 22:31:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523250846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:06,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:06,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:31:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504804132] [2025-01-09 22:31:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:31:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:06,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:31:06,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:31:06,718 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:06,783 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2025-01-09 22:31:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:31:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:31:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:06,784 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:31:06,784 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:31:06,784 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-01-09 22:31:06,785 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:06,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:31:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2025-01-09 22:31:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 97 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2025-01-09 22:31:06,791 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 13 [2025-01-09 22:31:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:06,792 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2025-01-09 22:31:06,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2025-01-09 22:31:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:31:06,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:06,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:31:06,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:06,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash 456500790, now seen corresponding path program 1 times [2025-01-09 22:31:06,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:06,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321116769] [2025-01-09 22:31:06,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:06,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:31:06,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:31:06,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:06,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321116769] [2025-01-09 22:31:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321116769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453749931] [2025-01-09 22:31:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:06,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:06,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:06,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:06,990 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:07,163 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-01-09 22:31:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:31:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:31:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:07,164 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:31:07,164 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:31:07,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:07,165 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 44 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:07,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 249 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:31:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2025-01-09 22:31:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2025-01-09 22:31:07,170 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 15 [2025-01-09 22:31:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-01-09 22:31:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2025-01-09 22:31:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:31:07,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:07,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:31:07,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash 456500791, now seen corresponding path program 1 times [2025-01-09 22:31:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538058030] [2025-01-09 22:31:07,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:07,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:31:07,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:31:07,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:07,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538058030] [2025-01-09 22:31:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538058030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:31:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613539290] [2025-01-09 22:31:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:07,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:31:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:07,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:31:07,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:07,542 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:07,800 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-01-09 22:31:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:31:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:31:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:07,801 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:31:07,802 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:31:07,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:07,802 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 16 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:07,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 282 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:31:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-01-09 22:31:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-01-09 22:31:07,811 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 15 [2025-01-09 22:31:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:07,812 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-01-09 22:31:07,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-01-09 22:31:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:31:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:07,812 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-01-09 22:31:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:31:07,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1251960594, now seen corresponding path program 1 times [2025-01-09 22:31:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106600287] [2025-01-09 22:31:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:07,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:31:07,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:31:07,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106600287] [2025-01-09 22:31:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106600287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500386822] [2025-01-09 22:31:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:08,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:08,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:08,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:08,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:08,114 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:08,324 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2025-01-09 22:31:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:08,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 22:31:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:08,325 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:31:08,325 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:31:08,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:31:08,326 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 31 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:08,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 500 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:31:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2025-01-09 22:31:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 100 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2025-01-09 22:31:08,333 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 22 [2025-01-09 22:31:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:08,333 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2025-01-09 22:31:08,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2025-01-09 22:31:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:31:08,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:08,336 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-01-09 22:31:08,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:31:08,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:08,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1251960595, now seen corresponding path program 1 times [2025-01-09 22:31:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058517482] [2025-01-09 22:31:08,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:08,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:31:08,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:31:08,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058517482] [2025-01-09 22:31:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058517482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049379529] [2025-01-09 22:31:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:08,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:08,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:08,461 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:08,650 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2025-01-09 22:31:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 22:31:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:08,651 INFO L225 Difference]: With dead ends: 135 [2025-01-09 22:31:08,652 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 22:31:08,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:08,652 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:08,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 311 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 22:31:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2025-01-09 22:31:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 118 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2025-01-09 22:31:08,658 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 22 [2025-01-09 22:31:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:08,658 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2025-01-09 22:31:08,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2025-01-09 22:31:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:31:08,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:08,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:08,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:31:08,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:08,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -542824529, now seen corresponding path program 1 times [2025-01-09 22:31:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579909559] [2025-01-09 22:31:08,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:08,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:31:08,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:31:08,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:08,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579909559] [2025-01-09 22:31:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579909559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781043356] [2025-01-09 22:31:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:31:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:08,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:31:08,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:08,785 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:08,834 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2025-01-09 22:31:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-09 22:31:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:08,836 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:31:08,836 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:31:08,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:08,837 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:08,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 557 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:31:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:31:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2025-01-09 22:31:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 120 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2025-01-09 22:31:08,842 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 24 [2025-01-09 22:31:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:08,842 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2025-01-09 22:31:08,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2025-01-09 22:31:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:31:08,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:08,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:08,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:31:08,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2077635798, now seen corresponding path program 1 times [2025-01-09 22:31:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:08,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897126922] [2025-01-09 22:31:08,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:08,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:08,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:08,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897126922] [2025-01-09 22:31:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897126922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:09,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:09,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:09,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217008628] [2025-01-09 22:31:09,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:09,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:09,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:09,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:09,034 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:09,185 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2025-01-09 22:31:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:31:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 22:31:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:09,187 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:31:09,187 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:31:09,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 22:31:09,188 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 19 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:09,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:31:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-01-09 22:31:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 120 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2025-01-09 22:31:09,192 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 26 [2025-01-09 22:31:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:09,193 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2025-01-09 22:31:09,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2025-01-09 22:31:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:31:09,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:09,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:09,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:31:09,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:09,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2077635799, now seen corresponding path program 1 times [2025-01-09 22:31:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782366189] [2025-01-09 22:31:09,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:09,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:09,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:09,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782366189] [2025-01-09 22:31:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782366189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471588984] [2025-01-09 22:31:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:09,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:09,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:09,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:09,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:31:09,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:09,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:09,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:31:09,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:09,739 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:31:09,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:09,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:31:09,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:09,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:09,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:31:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471588984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:31:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-01-09 22:31:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004679525] [2025-01-09 22:31:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:09,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:09,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:09,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:31:09,836 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:09,987 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-01-09 22:31:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 22:31:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:09,988 INFO L225 Difference]: With dead ends: 131 [2025-01-09 22:31:09,988 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 22:31:09,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:31:09,989 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:09,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 208 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 142 Unchecked, 0.1s Time] [2025-01-09 22:31:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 22:31:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2025-01-09 22:31:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 120 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2025-01-09 22:31:09,992 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 26 [2025-01-09 22:31:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:09,993 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-01-09 22:31:09,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2025-01-09 22:31:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:31:09,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:09,993 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-01-09 22:31:10,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:31:10,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:31:10,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:10,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1886935825, now seen corresponding path program 1 times [2025-01-09 22:31:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945901250] [2025-01-09 22:31:10,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:10,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:10,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:10,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:10,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945901250] [2025-01-09 22:31:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945901250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305849361] [2025-01-09 22:31:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:10,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:10,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:10,309 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:10,478 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2025-01-09 22:31:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:31:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:10,480 INFO L225 Difference]: With dead ends: 144 [2025-01-09 22:31:10,480 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 22:31:10,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:10,481 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 25 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:10,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 332 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 22:31:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2025-01-09 22:31:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.530612244897959) internal successors, (150), 130 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2025-01-09 22:31:10,486 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 26 [2025-01-09 22:31:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:10,486 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2025-01-09 22:31:10,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2025-01-09 22:31:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:31:10,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:10,490 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-01-09 22:31:10,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:31:10,491 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:10,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1886935826, now seen corresponding path program 1 times [2025-01-09 22:31:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:10,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822679199] [2025-01-09 22:31:10,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:31:10,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:31:10,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:10,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822679199] [2025-01-09 22:31:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822679199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808854650] [2025-01-09 22:31:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:10,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:10,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:10,693 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:10,840 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2025-01-09 22:31:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-09 22:31:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:10,842 INFO L225 Difference]: With dead ends: 139 [2025-01-09 22:31:10,842 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 22:31:10,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:31:10,842 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:10,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 557 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 22:31:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-01-09 22:31:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 134 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2025-01-09 22:31:10,849 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 26 [2025-01-09 22:31:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2025-01-09 22:31:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2025-01-09 22:31:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:31:10,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:10,852 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:31:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:31:10,852 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 74367514, now seen corresponding path program 1 times [2025-01-09 22:31:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450233512] [2025-01-09 22:31:10,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:10,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:31:10,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:31:10,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:10,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450233512] [2025-01-09 22:31:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450233512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041068956] [2025-01-09 22:31:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:11,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:11,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:11,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:11,119 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:11,293 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2025-01-09 22:31:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-09 22:31:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:11,295 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:31:11,295 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:31:11,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:11,296 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:11,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 348 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:31:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-09 22:31:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 133 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2025-01-09 22:31:11,301 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 29 [2025-01-09 22:31:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:11,302 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2025-01-09 22:31:11,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2025-01-09 22:31:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:31:11,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:11,302 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:31:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:31:11,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:11,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 74367513, now seen corresponding path program 1 times [2025-01-09 22:31:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579011819] [2025-01-09 22:31:11,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:11,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:31:11,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:31:11,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:11,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:31:11,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579011819] [2025-01-09 22:31:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579011819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:11,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:31:11,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187303381] [2025-01-09 22:31:11,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:11,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:31:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:11,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:31:11,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:31:11,464 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:11,646 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2025-01-09 22:31:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:31:11,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-09 22:31:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:11,647 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:31:11,648 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:31:11,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:11,649 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 313 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:31:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 22:31:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 132 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2025-01-09 22:31:11,657 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 29 [2025-01-09 22:31:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:11,657 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2025-01-09 22:31:11,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:31:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2025-01-09 22:31:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:31:11,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:11,658 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:31:11,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:31:11,659 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash -720526051, now seen corresponding path program 1 times [2025-01-09 22:31:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:11,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219068993] [2025-01-09 22:31:11,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:11,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:31:11,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:31:11,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:11,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219068993] [2025-01-09 22:31:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219068993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:11,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:31:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095580671] [2025-01-09 22:31:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:11,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:31:11,993 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:12,268 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2025-01-09 22:31:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:31:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-01-09 22:31:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:12,269 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:31:12,269 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:31:12,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:31:12,270 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 29 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:12,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 396 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:31:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-01-09 22:31:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 132 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2025-01-09 22:31:12,279 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 32 [2025-01-09 22:31:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:12,279 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2025-01-09 22:31:12,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2025-01-09 22:31:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:31:12,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:12,280 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 22:31:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:31:12,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:12,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash -720526050, now seen corresponding path program 1 times [2025-01-09 22:31:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536362907] [2025-01-09 22:31:12,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:12,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:31:12,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:31:12,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:12,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536362907] [2025-01-09 22:31:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536362907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:12,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:31:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414289615] [2025-01-09 22:31:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:12,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:31:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:12,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:31:12,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:31:12,701 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:13,038 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2025-01-09 22:31:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:31:13,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-01-09 22:31:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:13,039 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:31:13,039 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:31:13,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:31:13,040 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 25 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:13,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 503 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:31:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 22:31:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 132 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2025-01-09 22:31:13,050 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 32 [2025-01-09 22:31:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:13,051 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2025-01-09 22:31:13,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2025-01-09 22:31:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:31:13,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:13,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:13,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:31:13,052 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:13,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2081058450, now seen corresponding path program 1 times [2025-01-09 22:31:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:13,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064124607] [2025-01-09 22:31:13,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:13,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:31:13,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:31:13,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064124607] [2025-01-09 22:31:13,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064124607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:31:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932526407] [2025-01-09 22:31:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:31:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:13,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:31:13,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:13,162 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:13,360 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2025-01-09 22:31:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:31:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-01-09 22:31:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:13,361 INFO L225 Difference]: With dead ends: 155 [2025-01-09 22:31:13,361 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:31:13,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:31:13,362 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 58 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:13,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 264 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:31:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2025-01-09 22:31:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 114 states have (on average 1.4736842105263157) internal successors, (168), 143 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2025-01-09 22:31:13,366 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 31 [2025-01-09 22:31:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:13,366 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2025-01-09 22:31:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2025-01-09 22:31:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:31:13,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:13,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:31:13,367 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:13,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2081058449, now seen corresponding path program 1 times [2025-01-09 22:31:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294517602] [2025-01-09 22:31:13,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:13,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:31:13,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:31:13,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294517602] [2025-01-09 22:31:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294517602] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465384094] [2025-01-09 22:31:13,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:13,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:13,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:13,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:13,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:31:13,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:31:13,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:31:13,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:13,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:13,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:31:13,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:13,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:14,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:14,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-01-09 22:31:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465384094] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:14,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:14,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2025-01-09 22:31:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506213437] [2025-01-09 22:31:14,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 22:31:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:14,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 22:31:14,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:31:14,348 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 26 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:14,742 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2025-01-09 22:31:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:31:14,743 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 26 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-01-09 22:31:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:14,744 INFO L225 Difference]: With dead ends: 154 [2025-01-09 22:31:14,744 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 22:31:14,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:31:14,745 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:14,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 705 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 22:31:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2025-01-09 22:31:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 145 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2025-01-09 22:31:14,750 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 31 [2025-01-09 22:31:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:14,750 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2025-01-09 22:31:14,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 26 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2025-01-09 22:31:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:31:14,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:14,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:14,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:31:14,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:14,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:14,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash -88302440, now seen corresponding path program 1 times [2025-01-09 22:31:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:14,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932224555] [2025-01-09 22:31:14,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:14,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:31:14,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:31:14,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:14,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932224555] [2025-01-09 22:31:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932224555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538409136] [2025-01-09 22:31:15,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:15,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:15,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:31:15,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:31:15,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:31:15,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:15,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:15,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 22:31:15,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:15,477 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-01-09 22:31:15,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:31:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:15,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:31:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538409136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:31:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-01-09 22:31:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153101255] [2025-01-09 22:31:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:15,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:15,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:15,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:31:15,644 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:15,874 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2025-01-09 22:31:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:31:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-01-09 22:31:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:15,878 INFO L225 Difference]: With dead ends: 175 [2025-01-09 22:31:15,878 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 22:31:15,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:31:15,881 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:15,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 569 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 22:31:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2025-01-09 22:31:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 149 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2025-01-09 22:31:15,889 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 32 [2025-01-09 22:31:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:15,890 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2025-01-09 22:31:15,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2025-01-09 22:31:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:31:15,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:15,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:15,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:31:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:16,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1557591790, now seen corresponding path program 1 times [2025-01-09 22:31:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612038812] [2025-01-09 22:31:16,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:16,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:31:16,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:31:16,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:16,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612038812] [2025-01-09 22:31:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612038812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962893830] [2025-01-09 22:31:16,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:16,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:16,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:31:16,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:31:16,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:31:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:16,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 22:31:16,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:16,632 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-01-09 22:31:16,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 22:31:16,790 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 17 treesize of output 9 [2025-01-09 22:31:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:16,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:31:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962893830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:16,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:31:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-01-09 22:31:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062342018] [2025-01-09 22:31:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:16,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:16,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:16,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:31:16,796 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:17,122 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2025-01-09 22:31:17,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:31:17,122 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-01-09 22:31:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:17,123 INFO L225 Difference]: With dead ends: 174 [2025-01-09 22:31:17,123 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 22:31:17,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:31:17,124 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 40 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:17,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 526 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 22:31:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2025-01-09 22:31:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 150 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2025-01-09 22:31:17,128 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 33 [2025-01-09 22:31:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:17,128 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2025-01-09 22:31:17,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2025-01-09 22:31:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:31:17,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:17,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:17,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:31:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 22:31:17,330 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1558222302, now seen corresponding path program 1 times [2025-01-09 22:31:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758472831] [2025-01-09 22:31:17,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:17,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:31:17,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:31:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758472831] [2025-01-09 22:31:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758472831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:17,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:31:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098047935] [2025-01-09 22:31:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:17,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:17,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:17,431 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:17,511 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2025-01-09 22:31:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-01-09 22:31:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:17,513 INFO L225 Difference]: With dead ends: 155 [2025-01-09 22:31:17,513 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:31:17,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:17,513 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:17,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 508 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:31:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-01-09 22:31:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.396694214876033) internal successors, (169), 148 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2025-01-09 22:31:17,518 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 33 [2025-01-09 22:31:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:17,519 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2025-01-09 22:31:17,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2025-01-09 22:31:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:31:17,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:17,519 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-01-09 22:31:17,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:31:17,519 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:17,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1112887568, now seen corresponding path program 1 times [2025-01-09 22:31:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:17,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015081480] [2025-01-09 22:31:17,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:17,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:17,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:31:17,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:31:17,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:17,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:18,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015081480] [2025-01-09 22:31:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015081480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105070551] [2025-01-09 22:31:18,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:18,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:18,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:18,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:18,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:31:18,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:31:18,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:31:18,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:18,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:18,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-01-09 22:31:18,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:18,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:18,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 22:31:18,523 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-01-09 22:31:18,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 22:31:18,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 22:31:18,742 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:31:18,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:31:18,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 22:31:18,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 22:31:18,922 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:31:18,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-09 22:31:18,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 22:31:19,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-01-09 22:31:19,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 22:31:19,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-01-09 22:31:19,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:19,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-01-09 22:31:19,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-01-09 22:31:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:19,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:20,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:20,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 22:31:20,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:20,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 62 [2025-01-09 22:31:20,713 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 28 treesize of output 24 [2025-01-09 22:31:20,716 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 42 treesize of output 34 [2025-01-09 22:31:20,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:20,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 22:31:20,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:20,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 62 [2025-01-09 22:31:20,777 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 28 treesize of output 24 [2025-01-09 22:31:20,781 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 42 treesize of output 34 [2025-01-09 22:31:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:20,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105070551] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:20,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:20,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 40 [2025-01-09 22:31:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409879574] [2025-01-09 22:31:20,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:20,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 22:31:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:20,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 22:31:20,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1384, Unknown=32, NotChecked=0, Total=1560 [2025-01-09 22:31:20,916 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 40 states, 40 states have (on average 1.875) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:22,031 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2025-01-09 22:31:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:31:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-01-09 22:31:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:22,032 INFO L225 Difference]: With dead ends: 148 [2025-01-09 22:31:22,032 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 22:31:22,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=215, Invalid=2004, Unknown=37, NotChecked=0, Total=2256 [2025-01-09 22:31:22,033 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:22,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1264 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:31:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 22:31:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-01-09 22:31:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 143 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2025-01-09 22:31:22,038 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 33 [2025-01-09 22:31:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:22,038 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2025-01-09 22:31:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2025-01-09 22:31:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:31:22,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:22,039 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 22:31:22,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:31:22,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:31:22,240 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:22,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1054985920, now seen corresponding path program 1 times [2025-01-09 22:31:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982328723] [2025-01-09 22:31:22,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:22,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:31:22,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:31:22,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:22,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982328723] [2025-01-09 22:31:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982328723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:31:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492731331] [2025-01-09 22:31:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:22,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:31:22,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:22,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:31:22,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:31:22,565 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:22,898 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2025-01-09 22:31:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:31:22,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-01-09 22:31:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:22,900 INFO L225 Difference]: With dead ends: 149 [2025-01-09 22:31:22,900 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 22:31:22,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:31:22,900 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:22,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 489 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 22:31:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2025-01-09 22:31:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3793103448275863) internal successors, (160), 143 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2025-01-09 22:31:22,905 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 35 [2025-01-09 22:31:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:22,906 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2025-01-09 22:31:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2025-01-09 22:31:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:31:22,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:22,907 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 22:31:22,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:31:22,908 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:22,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1054985921, now seen corresponding path program 1 times [2025-01-09 22:31:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:22,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132649481] [2025-01-09 22:31:22,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:22,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:31:22,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:31:22,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:22,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:23,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132649481] [2025-01-09 22:31:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132649481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:23,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:23,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:31:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167613417] [2025-01-09 22:31:23,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:23,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:23,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:23,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:23,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:31:23,341 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:23,611 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2025-01-09 22:31:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:31:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-01-09 22:31:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:23,613 INFO L225 Difference]: With dead ends: 148 [2025-01-09 22:31:23,613 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 22:31:23,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:31:23,613 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:23,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 390 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 22:31:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-01-09 22:31:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 143 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 165 transitions. [2025-01-09 22:31:23,618 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 165 transitions. Word has length 35 [2025-01-09 22:31:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 165 transitions. [2025-01-09 22:31:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:31:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2025-01-09 22:31:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:31:23,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:23,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:31:23,619 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1040705370, now seen corresponding path program 1 times [2025-01-09 22:31:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388743796] [2025-01-09 22:31:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:23,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:31:23,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:31:23,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:23,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:23,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388743796] [2025-01-09 22:31:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388743796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579453497] [2025-01-09 22:31:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:23,925 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:23,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:31:24,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:31:24,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:31:24,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:24,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:24,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:31:24,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:24,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:24,180 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:31:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:31:24,222 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-01-09 22:31:24,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 22:31:24,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 17 treesize of output 9 [2025-01-09 22:31:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:24,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:31:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579453497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:24,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:31:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2025-01-09 22:31:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201463556] [2025-01-09 22:31:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:24,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:24,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:24,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:31:24,375 INFO L87 Difference]: Start difference. First operand 148 states and 165 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:24,615 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2025-01-09 22:31:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:31:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-01-09 22:31:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:24,616 INFO L225 Difference]: With dead ends: 149 [2025-01-09 22:31:24,616 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 22:31:24,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:31:24,616 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:24,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 563 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 22:31:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-09 22:31:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 144 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2025-01-09 22:31:24,627 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 34 [2025-01-09 22:31:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:24,628 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2025-01-09 22:31:24,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2025-01-09 22:31:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:31:24,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:24,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:24,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:31:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:31:24,832 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2097871759, now seen corresponding path program 1 times [2025-01-09 22:31:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168427639] [2025-01-09 22:31:24,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:24,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:31:24,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:31:24,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:25,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168427639] [2025-01-09 22:31:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168427639] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13220167] [2025-01-09 22:31:25,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:25,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:25,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:25,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:31:25,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:31:25,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:31:25,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:25,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:25,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:31:25,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:25,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:25,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:25,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:31:25,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-01-09 22:31:25,484 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-01-09 22:31:25,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:31:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:25,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:31:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13220167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:25,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:31:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2025-01-09 22:31:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844392538] [2025-01-09 22:31:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:31:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:25,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:31:25,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:31:25,498 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:25,772 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2025-01-09 22:31:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:31:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-01-09 22:31:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:25,773 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:31:25,773 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:31:25,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:31:25,774 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:25,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 519 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:31:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2025-01-09 22:31:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 145 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2025-01-09 22:31:25,777 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 35 [2025-01-09 22:31:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2025-01-09 22:31:25,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2025-01-09 22:31:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:31:25,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:25,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:25,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:31:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:25,979 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:25,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash -609515010, now seen corresponding path program 1 times [2025-01-09 22:31:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293847822] [2025-01-09 22:31:25,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:25,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:31:25,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:31:25,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:25,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:26,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293847822] [2025-01-09 22:31:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293847822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:26,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:31:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664077] [2025-01-09 22:31:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:26,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:26,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:31:26,269 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:26,468 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2025-01-09 22:31:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:31:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-01-09 22:31:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:26,469 INFO L225 Difference]: With dead ends: 159 [2025-01-09 22:31:26,469 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 22:31:26,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:31:26,470 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:26,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 580 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 22:31:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-01-09 22:31:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.361344537815126) internal successors, (162), 146 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2025-01-09 22:31:26,475 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 36 [2025-01-09 22:31:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:26,475 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2025-01-09 22:31:26,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2025-01-09 22:31:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:31:26,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:26,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:26,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 22:31:26,476 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1715095983, now seen corresponding path program 1 times [2025-01-09 22:31:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467343225] [2025-01-09 22:31:26,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:26,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:31:26,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:31:26,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:26,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467343225] [2025-01-09 22:31:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467343225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:26,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:31:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156277343] [2025-01-09 22:31:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:26,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:31:26,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:26,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:31:26,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:31:26,774 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:26,994 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2025-01-09 22:31:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:31:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-01-09 22:31:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:26,996 INFO L225 Difference]: With dead ends: 158 [2025-01-09 22:31:26,996 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 22:31:26,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:31:26,996 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:26,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 554 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 22:31:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2025-01-09 22:31:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 147 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2025-01-09 22:31:27,001 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 37 [2025-01-09 22:31:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:27,001 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2025-01-09 22:31:27,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2025-01-09 22:31:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:31:27,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:27,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:31:27,002 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1628367776, now seen corresponding path program 1 times [2025-01-09 22:31:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68578490] [2025-01-09 22:31:27,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:31:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:31:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68578490] [2025-01-09 22:31:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68578490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545193663] [2025-01-09 22:31:27,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:27,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:31:27,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:31:27,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:31:27,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:27,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:27,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 22:31:27,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:27,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:27,788 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:31:27,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:31:27,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:31:27,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-01-09 22:31:28,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2025-01-09 22:31:28,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:28,112 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 29 treesize of output 13 [2025-01-09 22:31:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:28,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:31:28,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545193663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:28,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:31:28,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 27 [2025-01-09 22:31:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682723004] [2025-01-09 22:31:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:28,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:31:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:28,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:31:28,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:31:28,117 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:28,431 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2025-01-09 22:31:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:31:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-01-09 22:31:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:28,432 INFO L225 Difference]: With dead ends: 153 [2025-01-09 22:31:28,432 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 22:31:28,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2025-01-09 22:31:28,433 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:28,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 582 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 22:31:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-01-09 22:31:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 148 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2025-01-09 22:31:28,438 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 38 [2025-01-09 22:31:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:28,438 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2025-01-09 22:31:28,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2025-01-09 22:31:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:31:28,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:28,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:28,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:31:28,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:28,643 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1493332157, now seen corresponding path program 1 times [2025-01-09 22:31:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:28,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202152755] [2025-01-09 22:31:28,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:28,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:31:28,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:31:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202152755] [2025-01-09 22:31:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202152755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 22:31:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346915446] [2025-01-09 22:31:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:28,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:31:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:28,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:31:28,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:31:28,997 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:29,323 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2025-01-09 22:31:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:31:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-01-09 22:31:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:29,324 INFO L225 Difference]: With dead ends: 157 [2025-01-09 22:31:29,324 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 22:31:29,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:31:29,325 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 47 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:29,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 579 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:31:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 22:31:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-01-09 22:31:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3495934959349594) internal successors, (166), 150 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2025-01-09 22:31:29,336 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 40 [2025-01-09 22:31:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:29,337 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2025-01-09 22:31:29,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2025-01-09 22:31:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:31:29,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:29,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:29,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:31:29,337 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:29,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -830976371, now seen corresponding path program 1 times [2025-01-09 22:31:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826292910] [2025-01-09 22:31:29,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:29,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:31:29,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:31:29,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:29,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:29,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826292910] [2025-01-09 22:31:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826292910] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480050189] [2025-01-09 22:31:29,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:29,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:29,582 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:29,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:31:29,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:31:29,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:31:29,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:29,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:29,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:31:29,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:31:29,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:29,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:29,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-01-09 22:31:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:31:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480050189] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:30,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:30,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2025-01-09 22:31:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388405818] [2025-01-09 22:31:30,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:30,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:31:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:30,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:31:30,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:31:30,084 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:31:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:30,253 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2025-01-09 22:31:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:31:30,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2025-01-09 22:31:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:30,254 INFO L225 Difference]: With dead ends: 158 [2025-01-09 22:31:30,254 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 22:31:30,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:31:30,254 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 33 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:30,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 635 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:31:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 22:31:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-01-09 22:31:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 150 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-01-09 22:31:30,258 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 44 [2025-01-09 22:31:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:30,258 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-01-09 22:31:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:31:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-01-09 22:31:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:31:30,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:30,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:30,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:31:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:30,459 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:30,459 INFO L85 PathProgramCache]: Analyzing trace with hash -586942820, now seen corresponding path program 1 times [2025-01-09 22:31:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96765495] [2025-01-09 22:31:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:30,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:31:30,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:31:30,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:30,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96765495] [2025-01-09 22:31:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96765495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:31:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:31:30,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:31:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281397667] [2025-01-09 22:31:30,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:31:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:31:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:30,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:31:30,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:30,569 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:30,680 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2025-01-09 22:31:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:31:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-01-09 22:31:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:30,682 INFO L225 Difference]: With dead ends: 156 [2025-01-09 22:31:30,682 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 22:31:30,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:31:30,682 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:30,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 448 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:31:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 22:31:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-09 22:31:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 151 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:31:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2025-01-09 22:31:30,687 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 43 [2025-01-09 22:31:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:30,687 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2025-01-09 22:31:30,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:31:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2025-01-09 22:31:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:31:30,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:30,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:30,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:31:30,688 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:30,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash 9536296, now seen corresponding path program 1 times [2025-01-09 22:31:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:30,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690985258] [2025-01-09 22:31:30,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:30,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:30,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:31:30,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:31:30,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:30,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690985258] [2025-01-09 22:31:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690985258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116717346] [2025-01-09 22:31:31,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:31,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:31,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:31,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:31,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:31:31,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:31:31,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:31:31,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:31,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:31,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:31:31,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:31,342 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:31:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:31,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:31:31,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:31,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:31,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:31,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116717346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:31,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:31,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2025-01-09 22:31:31,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709342942] [2025-01-09 22:31:31,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:31,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:31:31,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:31,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:31:31,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=611, Unknown=1, NotChecked=50, Total=756 [2025-01-09 22:31:31,662 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:32,016 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2025-01-09 22:31:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:31:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2025-01-09 22:31:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:32,017 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:31:32,017 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:31:32,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=762, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:31:32,018 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:32,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 664 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 521 Invalid, 0 Unknown, 164 Unchecked, 0.3s Time] [2025-01-09 22:31:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:31:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2025-01-09 22:31:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 171 states have internal predecessors, (193), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:31:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2025-01-09 22:31:32,022 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 45 [2025-01-09 22:31:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:32,022 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2025-01-09 22:31:32,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:31:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2025-01-09 22:31:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:31:32,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:32,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-01-09 22:31:32,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:31:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 22:31:32,227 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 818676469, now seen corresponding path program 1 times [2025-01-09 22:31:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686234732] [2025-01-09 22:31:32,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:32,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:32,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:32,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:32,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:32,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:31:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686234732] [2025-01-09 22:31:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686234732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502227240] [2025-01-09 22:31:32,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:32,732 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:32,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:31:32,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:32,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:32,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:32,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:32,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:31:32,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:32,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:32,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:32,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:33,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:33,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:33,059 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:33,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:33,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:33,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:31:33,101 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 31 treesize of output 13 [2025-01-09 22:31:33,112 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-01-09 22:31:33,142 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:31:33,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:31:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2025-01-09 22:31:33,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502227240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:33,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 23 [2025-01-09 22:31:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846621948] [2025-01-09 22:31:33,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:31:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:33,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:31:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2025-01-09 22:31:33,194 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:31:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:33,509 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2025-01-09 22:31:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:31:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-01-09 22:31:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:33,510 INFO L225 Difference]: With dead ends: 174 [2025-01-09 22:31:33,511 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 22:31:33,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=805, Unknown=1, NotChecked=58, Total=992 [2025-01-09 22:31:33,511 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 17 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:33,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 631 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2025-01-09 22:31:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 22:31:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-01-09 22:31:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 144 states have (on average 1.2986111111111112) internal successors, (187), 168 states have internal predecessors, (187), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:31:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2025-01-09 22:31:33,515 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 48 [2025-01-09 22:31:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:33,515 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2025-01-09 22:31:33,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:31:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2025-01-09 22:31:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:31:33,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:33,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-01-09 22:31:33,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:31:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 22:31:33,716 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:33,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash 818676470, now seen corresponding path program 1 times [2025-01-09 22:31:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:33,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822784119] [2025-01-09 22:31:33,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:33,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:33,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:33,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:33,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:34,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:34,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822784119] [2025-01-09 22:31:34,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822784119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713758582] [2025-01-09 22:31:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:34,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:34,466 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:34,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:31:34,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:31:34,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:31:34,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:34,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:34,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 22:31:34,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:34,716 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-01-09 22:31:34,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:34,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:34,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:31:34,798 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-01-09 22:31:34,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-09 22:31:34,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:31:34,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:34,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-09 22:31:34,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:31:35,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:31:35,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-09 22:31:35,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-09 22:31:35,042 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 42 treesize of output 18 [2025-01-09 22:31:35,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 22:31:35,077 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-01-09 22:31:35,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:35,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:31:35,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:35,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 22:31:35,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713758582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:35,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:31:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25 [2025-01-09 22:31:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533103498] [2025-01-09 22:31:35,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:35,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:31:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:35,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:31:35,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=623, Unknown=1, NotChecked=50, Total=756 [2025-01-09 22:31:35,214 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:31:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:35,841 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2025-01-09 22:31:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:31:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2025-01-09 22:31:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:35,842 INFO L225 Difference]: With dead ends: 169 [2025-01-09 22:31:35,842 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 22:31:35,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1221, Unknown=1, NotChecked=72, Total=1482 [2025-01-09 22:31:35,843 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:35,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 833 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 814 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2025-01-09 22:31:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 22:31:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-01-09 22:31:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2291666666666667) internal successors, (177), 163 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:31:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2025-01-09 22:31:35,846 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 48 [2025-01-09 22:31:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2025-01-09 22:31:35,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:31:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2025-01-09 22:31:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:31:35,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:35,847 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:35,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:31:36,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:36,048 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -801529048, now seen corresponding path program 1 times [2025-01-09 22:31:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371552232] [2025-01-09 22:31:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:36,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:31:36,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:31:36,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:36,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371552232] [2025-01-09 22:31:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371552232] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437181479] [2025-01-09 22:31:36,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:36,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:36,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:36,487 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:36,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:31:36,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:31:36,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:31:36,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:36,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:36,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-01-09 22:31:36,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:36,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:31:36,734 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-01-09 22:31:36,739 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-01-09 22:31:36,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:31:36,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:31:36,898 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:31:36,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:31:36,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-09 22:31:36,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-09 22:31:37,000 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:31:37,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:31:37,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-09 22:31:37,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-09 22:31:37,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:31:37,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:31:37,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:37,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:31:37,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 22:31:37,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:37,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 22:31:37,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:37,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 22:31:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:37,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:31:37,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 24))) (and (forall ((v_ArrVal_2654 Int) (v_ArrVal_2650 (Array Int Int)) (v_ArrVal_2657 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_2650))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_2654) .cse1 v_ArrVal_2657))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)) (forall ((|ULTIMATE.start_create_~data1~0#1.offset| Int) (|ULTIMATE.start_create_~data2~0#1.offset| Int) (v_ArrVal_2651 (Array Int Int))) (= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_2651))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data1~0#1.offset|) .cse1 |ULTIMATE.start_create_~data2~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8))))) is different from false [2025-01-09 22:31:39,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:39,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2025-01-09 22:31:39,084 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 104 treesize of output 98 [2025-01-09 22:31:39,090 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 276 treesize of output 268 [2025-01-09 22:31:39,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:39,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 125 [2025-01-09 22:31:39,127 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 99 treesize of output 97 [2025-01-09 22:31:39,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:39,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2025-01-09 22:31:39,248 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 198 treesize of output 190 [2025-01-09 22:31:39,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:39,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 161 [2025-01-09 22:31:39,274 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 158 treesize of output 154 [2025-01-09 22:31:39,283 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 234 treesize of output 226 [2025-01-09 22:31:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:31:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437181479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:31:39,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:31:39,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 21] total 49 [2025-01-09 22:31:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8226718] [2025-01-09 22:31:39,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:31:39,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 22:31:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:31:39,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 22:31:39,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2096, Unknown=7, NotChecked=92, Total=2352 [2025-01-09 22:31:39,585 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand has 49 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 46 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:31:40,849 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2025-01-09 22:31:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:31:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 46 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-01-09 22:31:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:31:40,851 INFO L225 Difference]: With dead ends: 213 [2025-01-09 22:31:40,851 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 22:31:40,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=278, Invalid=3501, Unknown=7, NotChecked=120, Total=3906 [2025-01-09 22:31:40,852 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 88 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:31:40,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1403 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1590 Invalid, 0 Unknown, 116 Unchecked, 0.8s Time] [2025-01-09 22:31:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 22:31:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2025-01-09 22:31:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 187 states have internal predecessors, (212), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:31:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2025-01-09 22:31:40,858 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 46 [2025-01-09 22:31:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:31:40,858 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2025-01-09 22:31:40,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 46 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:31:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2025-01-09 22:31:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:31:40,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:31:40,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:31:40,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:31:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:31:41,060 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-09 22:31:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:31:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash 922415329, now seen corresponding path program 1 times [2025-01-09 22:31:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:31:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313180052] [2025-01-09 22:31:41,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:31:41,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:41,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:41,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:41,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:31:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:31:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313180052] [2025-01-09 22:31:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313180052] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:31:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639291939] [2025-01-09 22:31:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:31:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:31:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:31:42,351 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:31:42,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:31:42,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:31:42,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:31:42,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:31:42,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:31:42,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-01-09 22:31:42,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:31:42,629 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:31:42,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-01-09 22:31:43,292 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-01-09 22:31:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 342 [2025-01-09 22:31:46,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:31:46,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:31:46,838 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 1632 treesize of output 818 [2025-01-09 22:32:08,010 WARN L851 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0) (let ((.cse5 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse81 (store (store .cse5 v_arrayElimCell_115 v_DerPreprocessor_7) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse81 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse81 v_arrayElimCell_115))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (.cse2 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse80 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (let ((.cse79 (store .cse80 v_arrayElimCell_115 0))) (and (= (select .cse79 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse80 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= (select .cse79 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))))) (.cse16 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0)))) (.cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse78 (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0))) (and (= (select .cse78 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse78 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)))))) (.cse20 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse77 (store .cse5 v_arrayElimCell_115 0))) (and (= (select (let ((.cse76 (store .cse77 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse76 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse76 v_arrayElimCell_115))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse77 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)))))) (.cse26 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse75 (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)))) (let ((.cse74 (store (store .cse75 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0))) (and (= (select (let ((.cse73 (store (store .cse5 v_arrayElimCell_117 (select .cse74 v_arrayElimCell_117)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse73 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse73 v_arrayElimCell_117))) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse75 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse74 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115))))))) (.cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (.cse7 (not (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (.cse1 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 24))) (.cse41 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (or (and .cse1 (or .cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse4 (store .cse5 v_arrayElimCell_115 0))) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_115)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse4 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse4 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse6 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse6 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))))) (and .cse1 .cse7 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse8 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse8 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse8 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse9 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115)) (= (select (store .cse9 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (let ((.cse10 (store .cse5 v_arrayElimCell_115 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse10 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse10 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse11 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= (select .cse11 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse11 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select .cse11 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= |c_#valid| (store .cse11 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))))) (and .cse1 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse12 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse12 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select .cse12 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse12 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) .cse13)) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse14 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= 1 (select .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= (select .cse14 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse15 (store (store .cse5 v_arrayElimCell_117 (select .cse14 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse15 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse15 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0))))) (and .cse1 (or .cse16 (exists ((v_prenex_12 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_118 Int)) (let ((.cse17 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select .cse17 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select .cse17 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse17 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) v_arrayElimCell_118 (select .cse17 v_arrayElimCell_118)) v_arrayElimCell_115)) v_arrayElimCell_118) 0)))))) (and (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse19 (store (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select (let ((.cse18 (store (store .cse5 v_arrayElimCell_117 (select .cse19 v_arrayElimCell_117)) v_arrayElimCell_118 (select .cse19 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse18 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse18 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse19 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse19 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select .cse19 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) .cse20 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse21 (store (store .cse5 v_arrayElimCell_118 0) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse21 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse21 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse21 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse23 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (= (select (let ((.cse22 (store .cse23 v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse22 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse22 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (store .cse23 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| v_arrayElimCell_115))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse24 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse24 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse25 (store (store .cse5 v_arrayElimCell_115 0) v_arrayElimCell_118 (select .cse24 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse25 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse25 v_arrayElimCell_115))) v_arrayElimCell_118) 0) (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) .cse26 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse29 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1)) (.cse27 (select |c_#valid| v_arrayElimCell_118))) (let ((.cse30 (store (store .cse29 v_arrayElimCell_118 .cse27) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_118 .cse27) v_arrayElimCell_115 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse28 (store .cse29 v_arrayElimCell_118 (select .cse30 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse28 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= (select .cse30 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select .cse30 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse31 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= 1 (select .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse31 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_117)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select (let ((.cse32 (store (store .cse5 v_arrayElimCell_117 (select .cse31 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse32 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse32 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0))))) .cse1) (and .cse1 (or .cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse33 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse33 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse33 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse34 (store (store .cse5 v_arrayElimCell_115 v_DerPreprocessor_7) v_arrayElimCell_118 (select .cse33 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse34 v_arrayElimCell_115))) v_arrayElimCell_118) 0) (= (select .cse33 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_118 Int)) (let ((.cse35 (store .cse5 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse35 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_118 Int)) (let ((.cse37 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 1))) (let ((.cse38 (store .cse37 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_118 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select (let ((.cse36 (store .cse37 v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse36 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| (select .cse36 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|))) v_arrayElimCell_118) 0) (= 1 (select .cse38 |c_ULTIMATE.start_destroy_~l#1.base|)) (= (select .cse38 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))) (and .cse1 (or .cse2 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int)) (let ((.cse39 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse39 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= |c_#valid| (store .cse39 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select .cse39 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1)))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_12| Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse40 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse40 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= |c_#valid| (store .cse40 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_118 (select .cse40 v_arrayElimCell_118)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) v_arrayElimCell_118) 0) (= (select .cse40 |v_ULTIMATE.start_destroy_#t~mem19#1.base_12|) 1))))))) .cse41) (and .cse1 .cse16) (and (or (and .cse3 .cse1) (and .cse1 .cse7 (or (exists ((v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store .cse5 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1))) (exists ((v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse42 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)))) (let ((.cse43 (store (store .cse42 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store (store .cse42 v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse43 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select .cse43 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0))))) (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))))) (and (or .cse3 .cse20 .cse26) .cse1) (and .cse1 .cse13)) .cse41) (and (let ((.cse49 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0))) (or (exists ((v_arrayElimCell_118 Int)) (let ((.cse44 (store .cse5 v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse44 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse44 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (and .cse1 (exists ((v_DerPreprocessor_7 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse45 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse45 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse45 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse46 (store (store .cse5 v_arrayElimCell_115 v_DerPreprocessor_7) v_arrayElimCell_118 (select .cse45 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse46 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse46 v_arrayElimCell_115))) v_arrayElimCell_118) 0))))) (and (exists ((v_DerPreprocessor_16 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_118 Int)) (let ((.cse47 (store (store .cse5 0 v_DerPreprocessor_16) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_118 0) 0 0)) (= (select .cse47 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse48 (store (store .cse5 0 (select .cse47 0)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse48 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse48 0))) v_arrayElimCell_118) 0)))) .cse49) (and .cse1 (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int) (v_arrayElimCell_118 Int)) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select .cse50 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse50 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) v_arrayElimCell_118 (select .cse50 v_arrayElimCell_118)) v_arrayElimCell_115)) v_arrayElimCell_118) 0))))) (and .cse1 .cse7 (or (and .cse49 (exists ((v_DerPreprocessor_14 Int) (v_prenex_11 Int) (v_arrayElimCell_115 Int)) (let ((.cse51 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (not (= v_arrayElimCell_115 0)) (= (select .cse51 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select .cse51 0)) |c_ULTIMATE.start_destroy_~l#1.base| 1) 0)) |c_ULTIMATE.start_destroy_~l#1.base|) 0))))) (exists ((v_prenex_12 Int) (v_arrayElimCell_115 Int) (v_DerPreprocessor_3 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_12) v_arrayElimCell_115 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115 v_DerPreprocessor_3) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))) (exists ((v_prenex_11 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int)) (let ((.cse52 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_115 0))) (and (= |c_#valid| (store .cse52 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_117 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117 (select .cse52 v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_117)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_117 0)) (= (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (exists ((v_arrayElimCell_115 Int)) (let ((.cse53 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse53 0 0))))))) (and .cse1 (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (= (select .cse54 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse54 0 0)))))) (and (or (exists ((v_arrayElimCell_115 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_115)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse55 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse55 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse55 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0))))) .cse1) (and .cse1 (or (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse56 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_117 0)) (= |c_#valid| (store .cse56 0 0)) (= (select .cse56 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_117)) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select (let ((.cse57 (store (store .cse5 v_arrayElimCell_117 (select .cse56 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse57 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse57 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (and .cse49 .cse7 (exists ((v_DerPreprocessor_18 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse58 (store (store .cse5 0 v_DerPreprocessor_18) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_115 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_118)) (not (= v_arrayElimCell_115 0)) (= (select .cse58 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse59 (store (store .cse5 0 (select .cse58 0)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse59 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse59 0))) v_arrayElimCell_118) 0))))) (and (exists ((v_DerPreprocessor_19 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse60 (select |c_#valid| v_arrayElimCell_118))) (let ((.cse63 (store (store (store .cse5 0 v_DerPreprocessor_19) v_arrayElimCell_118 .cse60) v_arrayElimCell_115 0))) (let ((.cse62 (select .cse63 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_118 .cse60) v_arrayElimCell_115 0) 0 0)) (= (select (let ((.cse61 (store (store .cse5 0 .cse62) v_arrayElimCell_118 (select .cse63 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse61 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse61 0))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= v_DerPreprocessor_19 .cse62) (= (select .cse63 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) .cse49) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse64 (store (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= |c_#valid| (store .cse64 0 0)) (= (select (let ((.cse65 (store (store .cse5 v_arrayElimCell_117 (select .cse64 v_arrayElimCell_117)) v_arrayElimCell_118 (select .cse64 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse65 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse65 v_arrayElimCell_117))) v_arrayElimCell_118) 0) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (not (= v_arrayElimCell_117 0)) (= (select .cse64 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_117 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0)))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse66 (store (store .cse5 v_arrayElimCell_118 0) v_arrayElimCell_115 0))) (and (= |c_#valid| (store .cse66 0 0)) (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_118) 0) (= (select .cse66 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse67 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse67 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse67 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (let ((.cse68 (store (store .cse5 v_arrayElimCell_115 0) v_arrayElimCell_118 (select .cse67 v_arrayElimCell_118)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse68 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 (select .cse68 v_arrayElimCell_115))) v_arrayElimCell_118) 0)))))) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_117 Int) (v_arrayElimCell_118 Int)) (let ((.cse69 (store (store .cse5 v_arrayElimCell_117 (select |c_#valid| v_arrayElimCell_117)) v_arrayElimCell_118 0))) (and (not (= v_arrayElimCell_118 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_117)) (not (= v_arrayElimCell_117 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_117) 0) (= (select .cse69 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse69 0 0)) (= (select (let ((.cse70 (store (store .cse5 v_arrayElimCell_117 (select .cse69 v_arrayElimCell_117)) v_arrayElimCell_118 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse70 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_117 (select .cse70 v_arrayElimCell_117))) v_arrayElimCell_118) 0)))) (and (or (exists ((v_arrayElimCell_115 Int)) (let ((.cse71 (store .cse5 v_arrayElimCell_115 0))) (and (= (select .cse71 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse71 0 0)) (not (= v_arrayElimCell_115 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0)))) (exists ((v_prenex_6 Int) (v_arrayElimCell_115 Int) (v_arrayElimCell_118 Int)) (let ((.cse72 (store (store .cse5 v_arrayElimCell_118 (select |c_#valid| v_arrayElimCell_118)) v_arrayElimCell_115 0))) (and (not (= v_arrayElimCell_118 0)) (= (select .cse72 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse72 0 0)) (not (= v_arrayElimCell_118 v_arrayElimCell_115)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_115) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_118 (select .cse72 v_arrayElimCell_118)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_115 v_prenex_6) v_arrayElimCell_118) 0))))) .cse1))) .cse41))))) is different from false