./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-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/sll-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 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:32:38,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:32:38,784 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:32:38,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:32:38,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:32:38,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:32:38,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:32:38,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:32:38,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:32:38,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:32:38,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:32:38,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:32:38,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:32:38,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:32:38,806 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:32:38,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:32:38,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:32:38,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:32:38,806 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:32:38,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:38,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:38,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:38,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:32:38,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:32:38,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:32:38,809 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 -> 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b [2025-01-09 22:32:39,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:32:39,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:32:39,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:32:39,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:32:39,022 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:32:39,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2025-01-09 22:32:40,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c92f545dd/74d2af57fa0c4653835f45a2babc2f81/FLAG564b39896 [2025-01-09 22:32:40,536 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:32:40,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2025-01-09 22:32:40,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c92f545dd/74d2af57fa0c4653835f45a2babc2f81/FLAG564b39896 [2025-01-09 22:32:40,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c92f545dd/74d2af57fa0c4653835f45a2babc2f81 [2025-01-09 22:32:40,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:32:40,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:32:40,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:40,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:32:40,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:32:40,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:40" (1/1) ... [2025-01-09 22:32:40,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b76d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:40, skipping insertion in model container [2025-01-09 22:32:40,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:40" (1/1) ... [2025-01-09 22:32:40,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:32:40,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:41,002 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:32:41,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:32:41,043 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:32:41,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41 WrapperNode [2025-01-09 22:32:41,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:32:41,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:41,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:32:41,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:32:41,049 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:32:41" (1/1) ... [2025-01-09 22:32:41,056 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:32:41" (1/1) ... [2025-01-09 22:32:41,068 INFO L138 Inliner]: procedures = 121, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 88 [2025-01-09 22:32:41,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:32:41,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:32:41,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:32:41,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:32:41,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,090 INFO L175 MemorySlicer]: Split 17 memory accesses to 1 slices as follows [17]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2025-01-09 22:32:41,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:32:41,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:32:41,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:32:41,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:32:41,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (1/1) ... [2025-01-09 22:32:41,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:32:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:41,133 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:32:41,136 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:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:32:41,155 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:32:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:32:41,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:32:41,243 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:32:41,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:32:41,523 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 22:32:41,523 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:32:41,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:32:41,530 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:32:41,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:41 BoogieIcfgContainer [2025-01-09 22:32:41,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:32:41,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:32:41,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:32:41,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:32:41,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:40" (1/3) ... [2025-01-09 22:32:41,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c78ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:41, skipping insertion in model container [2025-01-09 22:32:41,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:41" (2/3) ... [2025-01-09 22:32:41,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c78ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:41, skipping insertion in model container [2025-01-09 22:32:41,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:41" (3/3) ... [2025-01-09 22:32:41,540 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-middle-shared.i [2025-01-09 22:32:41,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:32:41,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-middle-shared.i that has 2 procedures, 101 locations, 1 initial locations, 3 loop locations, and 44 error locations. [2025-01-09 22:32:41,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:32:41,585 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;@11bb92e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:32:41,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-09 22:32:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 97 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:32:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:41,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:41,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:41,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:41,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 34533537, now seen corresponding path program 1 times [2025-01-09 22:32:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730028990] [2025-01-09 22:32:41,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:41,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:41,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:41,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:41,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:41,733 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:32:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730028990] [2025-01-09 22:32:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730028990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:41,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391460450] [2025-01-09 22:32:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:41,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:41,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:41,760 INFO L87 Difference]: Start difference. First operand has 101 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 97 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) 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:32:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:41,835 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2025-01-09 22:32:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:41,837 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:32:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:41,840 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:32:41,840 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:32:41,842 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:32:41,843 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:41,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:32:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:32:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 94 states have internal predecessors, (98), 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:32:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-01-09 22:32:41,885 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 5 [2025-01-09 22:32:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:41,885 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-01-09 22:32:41,885 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:32:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-01-09 22:32:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:32:41,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:41,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:32:41,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:32:41,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:41,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 34533538, now seen corresponding path program 1 times [2025-01-09 22:32:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397827318] [2025-01-09 22:32:41,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:32:41,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:32:41,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:41,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:41,983 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:32:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397827318] [2025-01-09 22:32:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397827318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633221289] [2025-01-09 22:32:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:41,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:41,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:41,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:41,989 INFO L87 Difference]: Start difference. First operand 98 states and 102 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:32:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:42,054 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2025-01-09 22:32:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:42,055 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:32:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:42,055 INFO L225 Difference]: With dead ends: 97 [2025-01-09 22:32:42,055 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 22:32:42,056 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:32:42,056 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:42,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 22:32:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 22:32:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 93 states have internal predecessors, (97), 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:32:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2025-01-09 22:32:42,061 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 5 [2025-01-09 22:32:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2025-01-09 22:32:42,061 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:32:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2025-01-09 22:32:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:32:42,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:42,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:42,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:32:42,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:42,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1291123644, now seen corresponding path program 1 times [2025-01-09 22:32:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026312235] [2025-01-09 22:32:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:42,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:32:42,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:32:42,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:42,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,129 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:32:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026312235] [2025-01-09 22:32:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026312235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800547201] [2025-01-09 22:32:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:42,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:42,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:42,131 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:32:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:42,224 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-01-09 22:32:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:42,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2025-01-09 22:32:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:42,226 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:32:42,228 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:32:42,229 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:32:42,229 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:42,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:32:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2025-01-09 22:32:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 92 states have internal predecessors, (96), 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:32:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2025-01-09 22:32:42,240 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 10 [2025-01-09 22:32:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2025-01-09 22:32:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:32:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2025-01-09 22:32:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 22:32:42,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:42,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:42,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:32:42,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1291123643, now seen corresponding path program 1 times [2025-01-09 22:32:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345988617] [2025-01-09 22:32:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:42,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 22:32:42,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 22:32:42,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,342 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:32:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345988617] [2025-01-09 22:32:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345988617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:42,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707370520] [2025-01-09 22:32:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:42,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:42,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:42,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:42,344 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:32:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:42,411 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-01-09 22:32:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2025-01-09 22:32:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:42,412 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:32:42,412 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:32:42,412 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:32:42,412 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:42,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 147 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:32:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2025-01-09 22:32:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.8269230769230769) 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:32:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2025-01-09 22:32:42,420 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2025-01-09 22:32:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:42,420 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2025-01-09 22:32:42,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:32:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2025-01-09 22:32:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:32:42,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:42,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:42,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:32:42,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:42,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 475726149, now seen corresponding path program 1 times [2025-01-09 22:32:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747329562] [2025-01-09 22:32:42,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:42,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:32:42,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:32:42,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:42,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,487 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:32:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747329562] [2025-01-09 22:32:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747329562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492146369] [2025-01-09 22:32:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:42,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:42,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:42,488 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:32:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:42,543 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2025-01-09 22:32:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:42,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-01-09 22:32:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:42,543 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:32:42,544 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:32:42,544 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:32:42,544 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:42,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:32:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2025-01-09 22:32:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 90 states have internal predecessors, (94), 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:32:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2025-01-09 22:32:42,552 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2025-01-09 22:32:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:42,552 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2025-01-09 22:32:42,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:32:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2025-01-09 22:32:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:32:42,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:42,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:42,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:32:42,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 475726150, now seen corresponding path program 1 times [2025-01-09 22:32:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078848326] [2025-01-09 22:32:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:42,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:32:42,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:32:42,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:42,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078848326] [2025-01-09 22:32:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078848326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:42,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:32:42,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945902899] [2025-01-09 22:32:42,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:42,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:32:42,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:42,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:32:42,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:32:42,642 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:32:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:42,687 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-01-09 22:32:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:32:42,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-01-09 22:32:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:42,688 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:32:42,688 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:32:42,689 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:32:42,689 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 12 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:42,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:32:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:32:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-01-09 22:32:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.7884615384615385) 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:32:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-01-09 22:32:42,697 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 12 [2025-01-09 22:32:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-01-09 22:32:42,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:32:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-01-09 22:32:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:32:42,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:42,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:42,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:32:42,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:42,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1906295430, now seen corresponding path program 1 times [2025-01-09 22:32:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:42,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089120009] [2025-01-09 22:32:42,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:42,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:32:42,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:32:42,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:42,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:42,869 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:32:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089120009] [2025-01-09 22:32:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089120009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037391705] [2025-01-09 22:32:42,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:42,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:42,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:42,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:42,871 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:32:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:42,995 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2025-01-09 22:32:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:32:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2025-01-09 22:32:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:42,996 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:32:42,996 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:32:42,996 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:32:42,997 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:42,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 277 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:32:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2025-01-09 22:32:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 84 states have internal predecessors, (88), 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:32:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2025-01-09 22:32:43,000 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 14 [2025-01-09 22:32:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:43,000 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2025-01-09 22:32:43,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:32:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2025-01-09 22:32:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:32:43,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:43,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:43,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:32:43,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1906295431, now seen corresponding path program 1 times [2025-01-09 22:32:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300807421] [2025-01-09 22:32:43,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:43,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:32:43,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:32:43,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:43,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:43,209 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:32:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300807421] [2025-01-09 22:32:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300807421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:43,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387295491] [2025-01-09 22:32:43,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:43,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:43,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:43,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:43,211 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:32:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:43,422 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-01-09 22:32:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:32:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2025-01-09 22:32:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:43,424 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:32:43,424 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:32:43,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:32:43,425 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:43,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:32:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2025-01-09 22:32:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 82 states have internal predecessors, (86), 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:32:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-01-09 22:32:43,431 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2025-01-09 22:32:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:43,431 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-01-09 22:32:43,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:32:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-01-09 22:32:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:32:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:43,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:43,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:32:43,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:43,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1493381638, now seen corresponding path program 1 times [2025-01-09 22:32:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722138455] [2025-01-09 22:32:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:43,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:32:43,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:32:43,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:43,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:43,550 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:32:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722138455] [2025-01-09 22:32:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722138455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856411402] [2025-01-09 22:32:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:43,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:43,553 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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:32:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:43,687 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2025-01-09 22:32:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:43,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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 21 [2025-01-09 22:32:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:43,688 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:32:43,688 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:32:43,688 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:32:43,689 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:43,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 241 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:32:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2025-01-09 22:32:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 98 states have internal predecessors, (115), 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:32:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2025-01-09 22:32:43,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2025-01-09 22:32:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2025-01-09 22:32:43,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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:32:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2025-01-09 22:32:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:32:43,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:43,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:43,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:32:43,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:43,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1493381637, now seen corresponding path program 1 times [2025-01-09 22:32:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:43,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918055870] [2025-01-09 22:32:43,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:43,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:32:43,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:32:43,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:43,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:43,926 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:32:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918055870] [2025-01-09 22:32:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918055870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:32:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329743233] [2025-01-09 22:32:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:43,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:43,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:43,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:43,928 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:32:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,100 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2025-01-09 22:32:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2025-01-09 22:32:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,101 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:32:44,101 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:32:44,101 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:32:44,102 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 466 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:32:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2025-01-09 22:32:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.5897435897435896) internal successors, (124), 106 states have internal predecessors, (124), 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:32:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2025-01-09 22:32:44,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 21 [2025-01-09 22:32:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,106 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2025-01-09 22:32:44,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:32:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2025-01-09 22:32:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:32:44,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:32:44,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash -620213188, now seen corresponding path program 1 times [2025-01-09 22:32:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135185753] [2025-01-09 22:32:44,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:32:44,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:32:44,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,187 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:32:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135185753] [2025-01-09 22:32:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135185753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:32:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642465747] [2025-01-09 22:32:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:44,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:44,189 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:32:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,240 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2025-01-09 22:32:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:44,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 23 [2025-01-09 22:32:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,241 INFO L225 Difference]: With dead ends: 117 [2025-01-09 22:32:44,241 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 22:32:44,242 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:32:44,242 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 511 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:32:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 22:32:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2025-01-09 22:32:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 107 states have internal predecessors, (123), 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:32:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2025-01-09 22:32:44,245 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 23 [2025-01-09 22:32:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,246 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2025-01-09 22:32:44,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:32:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2025-01-09 22:32:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:32:44,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:44,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:32:44,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:44,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,247 INFO L85 PathProgramCache]: Analyzing trace with hash -235076206, now seen corresponding path program 1 times [2025-01-09 22:32:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601514212] [2025-01-09 22:32:44,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:44,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:44,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601514212] [2025-01-09 22:32:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601514212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441431839] [2025-01-09 22:32:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:44,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:44,352 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:32:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:44,476 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2025-01-09 22:32:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:32:44,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2025-01-09 22:32:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:44,477 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:32:44,477 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:32:44,477 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:32:44,477 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 14 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:44,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:32:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 22:32:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 107 states have internal predecessors, (122), 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:32:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2025-01-09 22:32:44,481 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 24 [2025-01-09 22:32:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:44,481 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2025-01-09 22:32:44,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:32:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2025-01-09 22:32:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:32:44,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:44,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:44,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:32:44,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash -235076205, now seen corresponding path program 1 times [2025-01-09 22:32:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896381973] [2025-01-09 22:32:44,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:44,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:44,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:44,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896381973] [2025-01-09 22:32:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896381973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382178368] [2025-01-09 22:32:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:44,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:44,693 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:32:44,694 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:32:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:32:44,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:32:44,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:32:44,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:44,881 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:32:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:44,915 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:32:44,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:44,925 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:32:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:44,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382178368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-01-09 22:32:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569176612] [2025-01-09 22:32:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:44,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:44,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:44,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:32:44,942 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:32:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:45,036 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2025-01-09 22:32:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:45,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2025-01-09 22:32:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:45,037 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:32:45,037 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:32:45,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 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:32:45,037 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:45,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 199 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2025-01-09 22:32:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:32:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-01-09 22:32:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 107 states have internal predecessors, (118), 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:32:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2025-01-09 22:32:45,040 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 24 [2025-01-09 22:32:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:45,040 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2025-01-09 22:32:45,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:32:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2025-01-09 22:32:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:32:45,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:45,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:45,048 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:32:45,241 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:32:45,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:45,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1936415802, now seen corresponding path program 1 times [2025-01-09 22:32:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298339022] [2025-01-09 22:32:45,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:32:45,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:32:45,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:45,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:32:45,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298339022] [2025-01-09 22:32:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298339022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:45,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:45,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945384467] [2025-01-09 22:32:45,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:45,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:45,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:45,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:45,340 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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:32:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:45,449 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2025-01-09 22:32:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:45,449 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), 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 27 [2025-01-09 22:32:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:45,450 INFO L225 Difference]: With dead ends: 111 [2025-01-09 22:32:45,450 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 22:32:45,450 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:32:45,451 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 302 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:32:45,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 302 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 22:32:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 22:32:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 106 states have internal predecessors, (116), 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:32:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2025-01-09 22:32:45,453 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 27 [2025-01-09 22:32:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2025-01-09 22:32:45,453 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), 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:32:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2025-01-09 22:32:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:32:45,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:45,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:45,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:32:45,454 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:45,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1936415803, now seen corresponding path program 1 times [2025-01-09 22:32:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:45,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315474916] [2025-01-09 22:32:45,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:45,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:32:45,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:32:45,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:45,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315474916] [2025-01-09 22:32:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315474916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:45,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:32:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758800435] [2025-01-09 22:32:45,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:45,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:32:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:45,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:32:45,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:32:45,620 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:32:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:45,728 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2025-01-09 22:32:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:32:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2025-01-09 22:32:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:45,729 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:32:45,729 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:32:45,729 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:32:45,730 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:45,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 326 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:32:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 22:32:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 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:32:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2025-01-09 22:32:45,732 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2025-01-09 22:32:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:45,732 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2025-01-09 22:32:45,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:32:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2025-01-09 22:32:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:32:45,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:45,733 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] [2025-01-09 22:32:45,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:32:45,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:45,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1324053621, now seen corresponding path program 1 times [2025-01-09 22:32:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:45,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599459929] [2025-01-09 22:32:45,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:45,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:32:45,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:32:45,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:45,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599459929] [2025-01-09 22:32:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599459929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985449909] [2025-01-09 22:32:46,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:46,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:46,360 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:32:46,363 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:32:46,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:32:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:32:46,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:46,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:46,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-09 22:32:46,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:46,450 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:32:46,469 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:32:46,473 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:32:46,584 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:32:46,584 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:32:46,632 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 18 treesize of output 13 [2025-01-09 22:32:46,640 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 18 treesize of output 13 [2025-01-09 22:32:46,666 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:32:46,666 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:32:46,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:32:46,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:32:46,779 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 25 treesize of output 13 [2025-01-09 22:32:46,785 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 25 treesize of output 13 [2025-01-09 22:32:46,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:46,823 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 37 treesize of output 24 [2025-01-09 22:32:46,829 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:32:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:46,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:47,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_528 (Array Int Int)) (v_ArrVal_535 Int)) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_528))) (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| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_535))) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (forall ((v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_534 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_529))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_531) .cse1 v_ArrVal_534))) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 0)))) is different from false [2025-01-09 22:32:48,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:48,096 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 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-09 22:32:48,106 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 140 treesize of output 122 [2025-01-09 22:32:48,120 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 17 treesize of output 13 [2025-01-09 22:32:48,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 22:32:48,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:48,182 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 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-09 22:32:48,192 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 70 treesize of output 58 [2025-01-09 22:32:48,200 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 46 treesize of output 38 [2025-01-09 22:32:48,214 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 24 treesize of output 20 [2025-01-09 22:32:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985449909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:32:48,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:32:48,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2025-01-09 22:32:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046997587] [2025-01-09 22:32:48,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:48,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:32:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:48,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:32:48,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1205, Unknown=3, NotChecked=70, Total=1406 [2025-01-09 22:32:48,415 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 35 states have internal predecessors, (68), 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:32:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:49,409 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2025-01-09 22:32:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:32:49,410 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 35 states have internal predecessors, (68), 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 28 [2025-01-09 22:32:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:49,410 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:32:49,410 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:32:49,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=1615, Unknown=3, NotChecked=82, Total=1892 [2025-01-09 22:32:49,411 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:49,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1219 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 748 Invalid, 0 Unknown, 47 Unchecked, 0.7s Time] [2025-01-09 22:32:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:32:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 22:32:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 107 states have internal predecessors, (116), 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:32:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2025-01-09 22:32:49,415 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 28 [2025-01-09 22:32:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:49,415 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2025-01-09 22:32:49,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 35 states have internal predecessors, (68), 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:32:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2025-01-09 22:32:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:32:49,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:49,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:49,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:49,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 22:32:49,622 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2057420729, now seen corresponding path program 1 times [2025-01-09 22:32:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256022926] [2025-01-09 22:32:49,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:49,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256022926] [2025-01-09 22:32:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256022926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:49,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:49,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:32:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928020054] [2025-01-09 22:32:49,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:49,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:32:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:49,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:32:49,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:32:49,820 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:32:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:50,032 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2025-01-09 22:32:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:32:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2025-01-09 22:32:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:50,033 INFO L225 Difference]: With dead ends: 113 [2025-01-09 22:32:50,033 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 22:32:50,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:32:50,033 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:50,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 542 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 22:32:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-01-09 22:32:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 107 states have internal predecessors, (115), 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:32:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2025-01-09 22:32:50,038 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 30 [2025-01-09 22:32:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:50,038 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2025-01-09 22:32:50,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:32:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2025-01-09 22:32:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:32:50,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:50,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:32:50,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:32:50,039 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:50,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2057420730, now seen corresponding path program 1 times [2025-01-09 22:32:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549208391] [2025-01-09 22:32:50,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:50,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:50,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:50,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:50,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:50,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549208391] [2025-01-09 22:32:50,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549208391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:50,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:50,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:32:50,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866905643] [2025-01-09 22:32:50,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:50,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:32:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:50,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:32:50,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:32:50,320 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:32:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:50,662 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-01-09 22:32:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:32:50,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2025-01-09 22:32:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:50,663 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:32:50,664 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:32:50,664 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:32:50,664 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:50,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 392 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:32:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:32:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 22:32:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 107 states have internal predecessors, (114), 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:32:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-01-09 22:32:50,670 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 30 [2025-01-09 22:32:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:50,671 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-01-09 22:32:50,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:32:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-01-09 22:32:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:32:50,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:50,671 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] [2025-01-09 22:32:50,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:32:50,671 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:50,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1105674231, now seen corresponding path program 1 times [2025-01-09 22:32:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700061378] [2025-01-09 22:32:50,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:50,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:50,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:50,775 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:32:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700061378] [2025-01-09 22:32:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700061378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:50,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:32:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930869218] [2025-01-09 22:32:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:50,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:50,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:50,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:32:50,777 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:32:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:51,154 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2025-01-09 22:32:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:51,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 30 [2025-01-09 22:32:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:51,155 INFO L225 Difference]: With dead ends: 128 [2025-01-09 22:32:51,155 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 22:32:51,155 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:32:51,156 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:51,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 274 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:32:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 22:32:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2025-01-09 22:32:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 118 states have internal predecessors, (134), 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:32:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2025-01-09 22:32:51,161 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 30 [2025-01-09 22:32:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:51,161 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2025-01-09 22:32:51,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:32:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2025-01-09 22:32:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:32:51,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:51,162 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] [2025-01-09 22:32:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:32:51,162 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:51,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1105674232, now seen corresponding path program 1 times [2025-01-09 22:32:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293086052] [2025-01-09 22:32:51,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:51,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:51,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:51,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:51,397 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:32:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293086052] [2025-01-09 22:32:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293086052] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328428407] [2025-01-09 22:32:51,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:51,399 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:32:51,401 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:32:51,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:32:51,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:32:51,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:51,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:51,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:32:51,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:51,628 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:32:51,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:51,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:51,765 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 15 treesize of output 19 [2025-01-09 22:32:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:32:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328428407] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:51,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 22 [2025-01-09 22:32:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388928843] [2025-01-09 22:32:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:51,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:51,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:32:51,824 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:32:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:51,980 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2025-01-09 22:32:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:51,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 30 [2025-01-09 22:32:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:51,981 INFO L225 Difference]: With dead ends: 132 [2025-01-09 22:32:51,981 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 22:32:51,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:32:51,982 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:51,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 252 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 22:32:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2025-01-09 22:32:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.4375) internal successors, (138), 121 states have internal predecessors, (138), 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:32:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2025-01-09 22:32:51,989 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 30 [2025-01-09 22:32:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:51,989 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2025-01-09 22:32:51,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:32:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2025-01-09 22:32:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:32:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:51,989 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:32:52,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:52,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:52,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash -83837147, now seen corresponding path program 1 times [2025-01-09 22:32:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716394027] [2025-01-09 22:32:52,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:52,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:32:52,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:32:52,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:52,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:52,394 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:32:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716394027] [2025-01-09 22:32:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716394027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090249666] [2025-01-09 22:32:52,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:52,397 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:32:52,398 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:32:52,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:32:52,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:32:52,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:52,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:52,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:32:52,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:52,527 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:32:52,535 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 27 treesize of output 11 [2025-01-09 22:32:52,561 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:32:52,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090249666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2025-01-09 22:32:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237300460] [2025-01-09 22:32:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:52,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:52,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:52,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:32:52,563 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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:32:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:52,724 INFO L93 Difference]: Finished difference Result 144 states and 170 transitions. [2025-01-09 22:32:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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:32:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:52,725 INFO L225 Difference]: With dead ends: 144 [2025-01-09 22:32:52,725 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 22:32:52,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:52,726 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:52,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 410 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 22:32:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2025-01-09 22:32:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 122 states have internal predecessors, (139), 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:32:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2025-01-09 22:32:52,732 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 31 [2025-01-09 22:32:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:52,732 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2025-01-09 22:32:52,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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:32:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2025-01-09 22:32:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:32:52,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:52,733 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:32:52,742 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:32:52,933 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,SelfDestructingSolverStorable20 [2025-01-09 22:32:52,934 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:52,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -83817191, now seen corresponding path program 1 times [2025-01-09 22:32:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:52,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085259186] [2025-01-09 22:32:52,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:52,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:32:52,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:32:52,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:52,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:53,031 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:32:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085259186] [2025-01-09 22:32:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085259186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:53,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:53,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:32:53,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601842871] [2025-01-09 22:32:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:53,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:53,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:53,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:32:53,032 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) 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:32:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:53,107 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2025-01-09 22:32:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:53,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) 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:32:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:53,110 INFO L225 Difference]: With dead ends: 132 [2025-01-09 22:32:53,110 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 22:32:53,110 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:32:53,111 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:53,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 452 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 22:32:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2025-01-09 22:32:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 121 states have internal predecessors, (133), 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:32:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2025-01-09 22:32:53,119 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 31 [2025-01-09 22:32:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:53,119 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2025-01-09 22:32:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) 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:32:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2025-01-09 22:32:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:32:53,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:53,120 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:32:53,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:32:53,120 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:53,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1696015863, now seen corresponding path program 1 times [2025-01-09 22:32:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243082068] [2025-01-09 22:32:53,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:53,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:32:53,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:32:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:53,306 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:32:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243082068] [2025-01-09 22:32:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243082068] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734657186] [2025-01-09 22:32:53,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:53,309 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:32:53,318 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:32:53,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:32:53,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:32:53,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:53,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:53,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:32:53,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:53,447 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:32:53,452 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 29 treesize of output 13 [2025-01-09 22:32:53,474 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:32:53,477 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:32:53,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734657186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:53,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2025-01-09 22:32:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065847104] [2025-01-09 22:32:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:53,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:53,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:53,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:32:53,478 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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:32:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:53,663 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2025-01-09 22:32:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:32:53,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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:32:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:53,664 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:32:53,664 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:32:53,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:53,664 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 32 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:53,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 329 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:32:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2025-01-09 22:32:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 122 states have internal predecessors, (134), 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:32:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2025-01-09 22:32:53,667 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 32 [2025-01-09 22:32:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2025-01-09 22:32:53,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 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:32:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2025-01-09 22:32:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:32:53,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:53,668 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:32:53,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:32:53,872 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,SelfDestructingSolverStorable22 [2025-01-09 22:32:53,872 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:53,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1036884327, now seen corresponding path program 1 times [2025-01-09 22:32:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686268718] [2025-01-09 22:32:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:53,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:32:53,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:32:53,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:53,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:54,092 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:32:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686268718] [2025-01-09 22:32:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686268718] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658084839] [2025-01-09 22:32:54,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:54,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:54,094 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:32:54,099 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:32:54,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:32:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:32:54,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:54,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 22:32:54,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:54,203 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:32:54,222 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:32:54,222 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:32:54,237 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:32:54,243 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 29 treesize of output 13 [2025-01-09 22:32:54,261 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:32:54,264 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:32:54,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658084839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:54,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 11 [2025-01-09 22:32:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688598510] [2025-01-09 22:32:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:54,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:32:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:54,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:32:54,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:54,267 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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:32:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:54,423 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2025-01-09 22:32:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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:32:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:54,424 INFO L225 Difference]: With dead ends: 128 [2025-01-09 22:32:54,424 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 22:32:54,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:32:54,425 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:54,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 22:32:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-09 22:32:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 123 states have internal predecessors, (135), 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:32:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2025-01-09 22:32:54,428 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 33 [2025-01-09 22:32:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2025-01-09 22:32:54,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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:32:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2025-01-09 22:32:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:32:54,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:54,428 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:32:54,436 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:32:54,629 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,SelfDestructingSolverStorable23 [2025-01-09 22:32:54,629 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:54,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2078643194, now seen corresponding path program 1 times [2025-01-09 22:32:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858308064] [2025-01-09 22:32:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:54,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:54,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:54,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:54,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:54,851 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:32:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858308064] [2025-01-09 22:32:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858308064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204775016] [2025-01-09 22:32:54,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:54,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:54,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:54,855 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:32:54,856 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:32:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:54,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:54,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:54,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 22:32:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:54,958 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:32:54,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:54,996 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:32:55,022 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:32:55,041 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:32:55,113 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:32:55,124 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:32:55,125 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:32:55,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204775016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2025-01-09 22:32:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257772818] [2025-01-09 22:32:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:32:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:32:55,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:32:55,127 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:32:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:55,343 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2025-01-09 22:32:55,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:32:55,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:32:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:55,344 INFO L225 Difference]: With dead ends: 139 [2025-01-09 22:32:55,344 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 22:32:55,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 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:32:55,345 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 54 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:55,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 399 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 22:32:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2025-01-09 22:32:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 124 states have internal predecessors, (137), 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:32:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2025-01-09 22:32:55,348 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 34 [2025-01-09 22:32:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:55,348 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2025-01-09 22:32:55,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:32:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2025-01-09 22:32:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:32:55,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:55,348 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:32:55,357 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:32:55,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:55,549 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:55,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2078643195, now seen corresponding path program 1 times [2025-01-09 22:32:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:55,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317310233] [2025-01-09 22:32:55,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:55,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:55,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:55,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,699 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:32:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317310233] [2025-01-09 22:32:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317310233] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588706176] [2025-01-09 22:32:55,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:55,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:55,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:55,703 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:32:55,710 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:32:55,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:32:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:32:55,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:55,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:55,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:32:55,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:55,933 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:32:55,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588706176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2025-01-09 22:32:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539626168] [2025-01-09 22:32:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:32:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:55,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:32:55,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:32:55,935 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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:32:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:56,086 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2025-01-09 22:32:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:32:56,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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:32:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:56,086 INFO L225 Difference]: With dead ends: 142 [2025-01-09 22:32:56,086 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 22:32:56,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:32:56,087 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:56,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 313 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 22:32:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-01-09 22:32:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 129 states have internal predecessors, (145), 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:32:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2025-01-09 22:32:56,090 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 34 [2025-01-09 22:32:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:56,091 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2025-01-09 22:32:56,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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:32:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2025-01-09 22:32:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:32:56,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:56,091 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:32:56,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:32:56,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:32:56,292 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash 13429643, now seen corresponding path program 1 times [2025-01-09 22:32:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485891761] [2025-01-09 22:32:56,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:56,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:32:56,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:32:56,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:56,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:56,520 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:32:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485891761] [2025-01-09 22:32:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485891761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:56,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:32:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946278556] [2025-01-09 22:32:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:32:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:56,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:32:56,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:56,521 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 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:32:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:56,675 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-01-09 22:32:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:32:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 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:32:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:56,676 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:32:56,676 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:32:56,676 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:32:56,677 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 598 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:56,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 598 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:32:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:32:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-01-09 22:32:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 131 states have internal predecessors, (146), 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:32:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2025-01-09 22:32:56,679 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 35 [2025-01-09 22:32:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:56,679 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2025-01-09 22:32:56,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 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:32:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2025-01-09 22:32:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:32:56,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:56,679 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:32:56,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:32:56,679 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:56,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 416319066, now seen corresponding path program 1 times [2025-01-09 22:32:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:56,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786170178] [2025-01-09 22:32:56,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:56,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:32:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:32:56,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:56,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:56,869 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:32:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786170178] [2025-01-09 22:32:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786170178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:32:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748025279] [2025-01-09 22:32:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:32:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:56,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:32:56,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:32:56,870 INFO L87 Difference]: Start difference. First operand 136 states and 152 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:32:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:57,050 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2025-01-09 22:32:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:32:57,050 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:32:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:57,050 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:32:57,050 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:32:57,051 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:32:57,051 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 34 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:57,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 482 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:32:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-01-09 22:32:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 131 states have internal predecessors, (145), 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:32:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2025-01-09 22:32:57,056 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 36 [2025-01-09 22:32:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:57,056 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2025-01-09 22:32:57,056 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:32:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2025-01-09 22:32:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:32:57,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:57,057 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:32:57,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:32:57,057 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash 20989293, now seen corresponding path program 1 times [2025-01-09 22:32:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786339531] [2025-01-09 22:32:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:57,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:32:57,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:32:57,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:57,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:57,443 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:32:57,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786339531] [2025-01-09 22:32:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786339531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852082936] [2025-01-09 22:32:57,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:57,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:57,448 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:32:57,448 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:32:57,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:32:57,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:32:57,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:57,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:57,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:32:57,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:57,565 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:32:57,597 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:32:57,597 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:32:57,647 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:32:57,674 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:32:57,859 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 37 treesize of output 18 [2025-01-09 22:32:57,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:32:57,889 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 35 treesize of output 13 [2025-01-09 22:32:57,892 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:32:57,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:32:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852082936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:32:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-01-09 22:32:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586933664] [2025-01-09 22:32:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:32:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:57,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:32:57,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:32:57,893 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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:32:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:58,143 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2025-01-09 22:32:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:32:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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:32:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:58,144 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:32:58,144 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:32:58,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:32:58,145 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:58,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 376 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:32:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:32:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 22:32:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 131 states have internal predecessors, (144), 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:32:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-01-09 22:32:58,147 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 37 [2025-01-09 22:32:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-01-09 22:32:58,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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:32:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-01-09 22:32:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:32:58,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:58,148 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, 1, 1, 1, 1] [2025-01-09 22:32:58,154 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:32:58,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 22:32:58,349 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:58,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash -548308086, now seen corresponding path program 1 times [2025-01-09 22:32:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406347527] [2025-01-09 22:32:58,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:58,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:58,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:58,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:32:58,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:58,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406347527] [2025-01-09 22:32:58,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406347527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:58,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762920297] [2025-01-09 22:32:58,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:58,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:58,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:32:58,500 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:32:58,502 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:32:58,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:58,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:58,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:58,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:58,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:32:58,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:32:58,733 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:32:58,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:32:58,753 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:32:58,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:32:58,761 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:32:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:32:58,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:32:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762920297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:32:58,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:32:58,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2025-01-09 22:32:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273626943] [2025-01-09 22:32:58,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:32:58,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:32:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:32:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=490, Unknown=1, NotChecked=44, Total=600 [2025-01-09 22:32:58,988 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 21 states, 20 states have (on average 3.4) internal successors, (68), 18 states have internal predecessors, (68), 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:32:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:32:59,363 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2025-01-09 22:32:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:32:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 18 states have internal predecessors, (68), 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 39 [2025-01-09 22:32:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:32:59,364 INFO L225 Difference]: With dead ends: 169 [2025-01-09 22:32:59,364 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 22:32:59,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=932, Unknown=3, NotChecked=62, Total=1122 [2025-01-09 22:32:59,364 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 61 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:32:59,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 743 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 526 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2025-01-09 22:32:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 22:32:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2025-01-09 22:32:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.353846153846154) internal successors, (176), 155 states have internal predecessors, (176), 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:32:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2025-01-09 22:32:59,372 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 39 [2025-01-09 22:32:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:32:59,372 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2025-01-09 22:32:59,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 18 states have internal predecessors, (68), 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:32:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2025-01-09 22:32:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:32:59,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:32:59,373 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] [2025-01-09 22:32:59,380 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:32:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:32:59,574 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:32:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:32:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1304121392, now seen corresponding path program 1 times [2025-01-09 22:32:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:32:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037033527] [2025-01-09 22:32:59,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:32:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:32:59,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:32:59,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:32:59,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:32:59,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:32:59,864 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:32:59,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:32:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037033527] [2025-01-09 22:32:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037033527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:32:59,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:32:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 22:32:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53007639] [2025-01-09 22:32:59,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:32:59,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:32:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:32:59,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:32:59,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:32:59,866 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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:33:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:00,052 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2025-01-09 22:33:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:33:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 39 [2025-01-09 22:33:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:00,053 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:33:00,053 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:33:00,053 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:33:00,054 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 48 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:00,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 485 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:33:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:33:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-01-09 22:33:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 155 states have internal predecessors, (175), 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:33:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2025-01-09 22:33:00,057 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 39 [2025-01-09 22:33:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2025-01-09 22:33:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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:33:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2025-01-09 22:33:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:33:00,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:00,057 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:33:00,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 22:33:00,058 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:00,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 940456355, now seen corresponding path program 1 times [2025-01-09 22:33:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816221873] [2025-01-09 22:33:00,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:00,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:00,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:33:00,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:33:00,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:00,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:33:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816221873] [2025-01-09 22:33:00,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816221873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755464842] [2025-01-09 22:33:00,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:00,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:00,334 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:33:00,337 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:33:00,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:33:00,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:33:00,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:00,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:33:00,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:00,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:00,494 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:33:00,507 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:33:00,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:00,546 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:33:00,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:00,581 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:33:00,589 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:33:00,599 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:33:00,618 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:33:00,618 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:33:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-01-09 22:33:00,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755464842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:00,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 21 [2025-01-09 22:33:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982346445] [2025-01-09 22:33:00,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:00,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:33:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:00,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:33:00,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:33:00,662 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 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:33:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:00,969 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2025-01-09 22:33:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:33:00,973 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 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 42 [2025-01-09 22:33:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:00,973 INFO L225 Difference]: With dead ends: 159 [2025-01-09 22:33:00,973 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 22:33:00,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:33:00,974 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:00,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 530 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2025-01-09 22:33:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 22:33:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-01-09 22:33:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 153 states have internal predecessors, (171), 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:33:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2025-01-09 22:33:00,979 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 42 [2025-01-09 22:33:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:00,979 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2025-01-09 22:33:00,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 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:33:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2025-01-09 22:33:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:33:00,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:00,980 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:33:00,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:01,184 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,SelfDestructingSolverStorable31 [2025-01-09 22:33:01,184 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 940456356, now seen corresponding path program 1 times [2025-01-09 22:33:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519472094] [2025-01-09 22:33:01,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:01,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:33:01,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:33:01,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:01,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519472094] [2025-01-09 22:33:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519472094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698021092] [2025-01-09 22:33:01,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:01,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:01,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:01,702 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:33:01,704 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:33:01,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:33:01,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:33:01,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:01,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:01,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:33:01,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:01,854 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:33:01,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:01,878 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:33:01,884 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:33:01,890 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:33:01,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:01,912 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:33:01,920 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:33:01,989 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:01,990 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:33:01,994 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:33:02,028 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:33:02,034 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:33:02,085 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:33:02,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:02,106 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:33:02,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:02,111 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:33:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:33:02,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698021092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:02,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 22 [2025-01-09 22:33:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798450757] [2025-01-09 22:33:02,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:02,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:33:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:02,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:33:02,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2025-01-09 22:33:02,188 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:33:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:02,700 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2025-01-09 22:33:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:33:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2025-01-09 22:33:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:02,701 INFO L225 Difference]: With dead ends: 155 [2025-01-09 22:33:02,701 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 22:33:02,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1021, Unknown=1, NotChecked=66, Total=1260 [2025-01-09 22:33:02,702 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 22 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:02,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 778 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 728 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2025-01-09 22:33:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 22:33:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-01-09 22:33:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 149 states have internal predecessors, (163), 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:33:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2025-01-09 22:33:02,704 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 42 [2025-01-09 22:33:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:02,705 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2025-01-09 22:33:02,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:33:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2025-01-09 22:33:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:33:02,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:02,705 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] [2025-01-09 22:33:02,717 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:33:02,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:02,905 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1193855013, now seen corresponding path program 1 times [2025-01-09 22:33:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:02,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599767543] [2025-01-09 22:33:02,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:33:02,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:33:02,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:02,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:02,980 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:33:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599767543] [2025-01-09 22:33:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599767543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:33:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:33:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:33:02,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879478758] [2025-01-09 22:33:02,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:33:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:33:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:02,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:33:02,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:33:02,982 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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:33:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:03,075 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2025-01-09 22:33:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:33:03,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 42 [2025-01-09 22:33:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:03,076 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:33:03,076 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:33:03,076 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:33:03,076 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:03,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 364 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:33:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:33:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2025-01-09 22:33:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 153 states have internal predecessors, (170), 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:33:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2025-01-09 22:33:03,078 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 42 [2025-01-09 22:33:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:03,078 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2025-01-09 22:33:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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:33:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2025-01-09 22:33:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:33:03,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:03,079 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] [2025-01-09 22:33:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:33:03,079 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -489336267, now seen corresponding path program 1 times [2025-01-09 22:33:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300968590] [2025-01-09 22:33:03,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:03,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:33:03,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:33:03,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:03,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:03,355 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:33:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300968590] [2025-01-09 22:33:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300968590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197699637] [2025-01-09 22:33:03,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:03,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:03,360 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:33:03,361 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:33:03,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:33:03,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:33:03,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:03,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:03,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:33:03,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:03,506 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:33:03,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 11 treesize of output 7 [2025-01-09 22:33:03,528 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:33:03,623 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:33:03,623 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:33:03,652 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 16 treesize of output 11 [2025-01-09 22:33:03,655 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 16 treesize of output 11 [2025-01-09 22:33:03,673 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:33:03,673 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 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:33:03,713 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 16 treesize of output 11 [2025-01-09 22:33:03,717 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 16 treesize of output 11 [2025-01-09 22:33:03,739 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 23 treesize of output 11 [2025-01-09 22:33:03,742 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 23 treesize of output 11 [2025-01-09 22:33:03,772 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 31 treesize of output 22 [2025-01-09 22:33:03,776 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 11 [2025-01-09 22:33:03,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:33:04,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:04,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:04,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2025-01-09 22:33:04,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:04,031 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 17 treesize of output 15 [2025-01-09 22:33:04,104 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:33:04,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:05,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:05,211 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 1 case distinctions, treesize of input 31 treesize of output 32 [2025-01-09 22:33:05,215 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 94 treesize of output 90 [2025-01-09 22:33:05,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:05,224 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 89 treesize of output 91 [2025-01-09 22:33:05,231 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 180 treesize of output 176 [2025-01-09 22:33:05,238 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 157 treesize of output 153 [2025-01-09 22:33:05,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:05,356 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 1 case distinctions, treesize of input 31 treesize of output 32 [2025-01-09 22:33:05,360 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 94 treesize of output 90 [2025-01-09 22:33:05,364 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 160 treesize of output 156 [2025-01-09 22:33:05,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:05,375 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 109 treesize of output 111 [2025-01-09 22:33:05,383 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:33:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:05,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197699637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:33:05,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:33:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 21] total 48 [2025-01-09 22:33:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759082961] [2025-01-09 22:33:05,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:33:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:05,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:33:05,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2105, Unknown=4, NotChecked=0, Total=2256 [2025-01-09 22:33:05,764 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 48 states, 48 states have (on average 2.4375) internal successors, (117), 45 states have internal predecessors, (117), 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:33:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:07,159 INFO L93 Difference]: Finished difference Result 206 states and 246 transitions. [2025-01-09 22:33:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:33:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 45 states have internal predecessors, (117), 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 45 [2025-01-09 22:33:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:07,160 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:33:07,160 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:33:07,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=3619, Unknown=4, NotChecked=0, Total=3906 [2025-01-09 22:33:07,161 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 82 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:07,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 933 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 22:33:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:33:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 186. [2025-01-09 22:33:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 180 states have internal predecessors, (216), 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:33:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 224 transitions. [2025-01-09 22:33:07,164 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 224 transitions. Word has length 45 [2025-01-09 22:33:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 224 transitions. [2025-01-09 22:33:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.4375) internal successors, (117), 45 states have internal predecessors, (117), 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:33:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 224 transitions. [2025-01-09 22:33:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:33:07,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:07,165 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, 1] [2025-01-09 22:33:07,174 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:33:07,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:07,369 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:07,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 36845574, now seen corresponding path program 1 times [2025-01-09 22:33:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:07,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878717948] [2025-01-09 22:33:07,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:07,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:07,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:07,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:07,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878717948] [2025-01-09 22:33:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878717948] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621056895] [2025-01-09 22:33:07,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:07,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:07,851 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:33:07,853 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:33:07,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:07,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:07,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:08,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 22:33:08,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:08,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:08,069 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:33:08,089 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:33:08,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:08,146 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 31 treesize of output 32 [2025-01-09 22:33:08,177 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:08,177 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:33:08,260 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:33:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:08,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:08,337 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-09 22:33:08,337 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 21 treesize of output 20 [2025-01-09 22:33:08,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2059) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) |c_ULTIMATE.start_create_#t~mem12#1.base|)) is different from false [2025-01-09 22:33:08,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2059) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) .cse0))) is different from false [2025-01-09 22:33:08,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2058 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2058))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (= (select (select (store .cse0 .cse1 v_ArrVal_2059) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) .cse1)))) is different from false [2025-01-09 22:33:08,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:08,391 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 1 case distinctions, treesize of input 63 treesize of output 44 [2025-01-09 22:33:08,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:08,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 498 treesize of output 395 [2025-01-09 22:33:08,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:08,412 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 335 treesize of output 279 [2025-01-09 22:33:08,419 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 271 treesize of output 239 [2025-01-09 22:33:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621056895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:08,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 29 [2025-01-09 22:33:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112235989] [2025-01-09 22:33:08,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:33:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:33:08,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1069, Unknown=10, NotChecked=204, Total=1406 [2025-01-09 22:33:08,592 INFO L87 Difference]: Start difference. First operand 186 states and 224 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:33:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:09,117 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2025-01-09 22:33:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:33:09,117 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2025-01-09 22:33:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:09,118 INFO L225 Difference]: With dead ends: 187 [2025-01-09 22:33:09,119 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 22:33:09,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1768, Unknown=10, NotChecked=264, Total=2256 [2025-01-09 22:33:09,120 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 18 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:09,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1074 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:33:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 22:33:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-01-09 22:33:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 162 states have (on average 1.345679012345679) internal successors, (218), 181 states have internal predecessors, (218), 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:33:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2025-01-09 22:33:09,124 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 46 [2025-01-09 22:33:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2025-01-09 22:33:09,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:33:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2025-01-09 22:33:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:33:09,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:09,124 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, 1] [2025-01-09 22:33:09,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 22:33:09,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 22:33:09,325 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 36845575, now seen corresponding path program 1 times [2025-01-09 22:33:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672787457] [2025-01-09 22:33:09,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:09,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:09,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:09,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672787457] [2025-01-09 22:33:09,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672787457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541332010] [2025-01-09 22:33:09,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:09,914 INFO L229 MonitoredProcess]: Starting monitored process 16 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:33:09,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:33:10,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:10,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:10,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:10,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 22:33:10,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:10,118 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:33:10,171 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:33:10,172 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:33:10,199 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:33:10,204 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:33:10,285 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:10,286 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 62 treesize of output 57 [2025-01-09 22:33:10,290 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:33:10,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:33:10,337 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 62 treesize of output 57 [2025-01-09 22:33:10,342 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:33:10,455 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:33:10,459 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:33:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:33:10,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:33:10,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2188 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2189))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2188) .cse0 v_ArrVal_2191) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2190) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2188) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2189) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2191) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))))) is different from false [2025-01-09 22:33:10,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2189))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2188) .cse1 v_ArrVal_2191) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2190) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2188) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2189) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_2191) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)))))) is different from false [2025-01-09 22:33:10,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:10,825 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 1 case distinctions, treesize of input 89 treesize of output 90 [2025-01-09 22:33:10,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:10,830 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 1 case distinctions, treesize of input 79 treesize of output 60 [2025-01-09 22:33:10,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:10,838 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 754 treesize of output 651 [2025-01-09 22:33:10,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:10,857 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 2217 treesize of output 2078 [2025-01-09 22:33:10,874 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 655 treesize of output 607 [2025-01-09 22:33:10,880 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 607 treesize of output 559 [2025-01-09 22:33:10,885 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 559 treesize of output 543 [2025-01-09 22:33:10,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:10,896 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 543 treesize of output 447 [2025-01-09 22:33:11,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:11,149 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2025-01-09 22:33:11,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:11,156 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-01-09 22:33:11,158 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:11,159 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 34 treesize of output 22 [2025-01-09 22:33:11,161 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:33:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:11,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 22:33:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541332010] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:11,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:33:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2025-01-09 22:33:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910291565] [2025-01-09 22:33:11,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:33:11,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:33:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:33:11,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:33:11,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1530, Unknown=44, NotChecked=162, Total=1892 [2025-01-09 22:33:11,263 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand has 33 states, 32 states have (on average 2.5625) internal successors, (82), 29 states have internal predecessors, (82), 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:33:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:33:11,833 INFO L93 Difference]: Finished difference Result 191 states and 229 transitions. [2025-01-09 22:33:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:33:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 29 states have internal predecessors, (82), 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 46 [2025-01-09 22:33:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:33:11,834 INFO L225 Difference]: With dead ends: 191 [2025-01-09 22:33:11,834 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 22:33:11,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=2082, Unknown=45, NotChecked=190, Total=2550 [2025-01-09 22:33:11,835 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 18 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:33:11,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1064 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:33:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 22:33:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-09 22:33:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.3313253012048192) internal successors, (221), 185 states have internal predecessors, (221), 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:33:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 229 transitions. [2025-01-09 22:33:11,838 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 229 transitions. Word has length 46 [2025-01-09 22:33:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:33:11,839 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 229 transitions. [2025-01-09 22:33:11,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 29 states have internal predecessors, (82), 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:33:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 229 transitions. [2025-01-09 22:33:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:33:11,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:33:11,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:11,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:33:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 22:33:12,043 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-01-09 22:33:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:33:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2010456938, now seen corresponding path program 1 times [2025-01-09 22:33:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:33:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014578804] [2025-01-09 22:33:12,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:33:12,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:12,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:12,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:13,184 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:33:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:33:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014578804] [2025-01-09 22:33:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014578804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:33:13,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196016270] [2025-01-09 22:33:13,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:33:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:33:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:33:13,187 INFO L229 MonitoredProcess]: Starting monitored process 17 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:33:13,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:33:13,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:33:13,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:33:13,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:33:13,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:33:13,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-09 22:33:13,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:33:13,411 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:33:13,412 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:33:13,468 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-09 22:33:13,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2025-01-09 22:33:13,525 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:33:13,563 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 36 treesize of output 24 [2025-01-09 22:33:13,813 INFO L349 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2025-01-09 22:33:13,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 80 [2025-01-09 22:33:13,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:33:13,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:33:13,870 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 6 case distinctions, treesize of input 60 treesize of output 54