./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.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-shared-sll-before.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 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:34:09,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:34:09,907 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:34:09,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:34:09,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:34:09,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:34:09,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:34:09,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:34:09,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:34:09,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:34:09,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:34:09,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:34:09,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:34:09,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:34:09,937 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:34:09,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:34:09,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:34:09,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:34:09,938 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:34:09,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:34:09,938 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:34:09,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:09,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:09,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:34:09,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:34:09,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:34:09,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:34:09,940 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 -> 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d [2025-01-09 22:34:10,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:34:10,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:34:10,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:34:10,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:34:10,180 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:34:10,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2025-01-09 22:34:11,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9a84c86/b8c6d55d2324498b87bb402a5b654aa8/FLAG5988c53ae [2025-01-09 22:34:11,651 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:34:11,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2025-01-09 22:34:11,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9a84c86/b8c6d55d2324498b87bb402a5b654aa8/FLAG5988c53ae [2025-01-09 22:34:11,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c9a84c86/b8c6d55d2324498b87bb402a5b654aa8 [2025-01-09 22:34:11,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:34:11,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:34:11,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:11,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:34:11,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:34:11,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:11" (1/1) ... [2025-01-09 22:34:11,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5916f4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:11, skipping insertion in model container [2025-01-09 22:34:11,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:11" (1/1) ... [2025-01-09 22:34:11,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:34:11,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:11,946 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:34:11,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:12,019 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:34:12,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12 WrapperNode [2025-01-09 22:34:12,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:12,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:12,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:34:12,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:34:12,027 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:34:12" (1/1) ... [2025-01-09 22:34:12,036 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:34:12" (1/1) ... [2025-01-09 22:34:12,053 INFO L138 Inliner]: procedures = 120, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 79 [2025-01-09 22:34:12,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:12,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:34:12,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:34:12,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:34:12,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,076 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2025-01-09 22:34:12,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:34:12,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:34:12,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:34:12,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:34:12,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (1/1) ... [2025-01-09 22:34:12,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:12,122 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:34:12,124 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:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-01-09 22:34:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-01-09 22:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:34:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:34:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:34:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:34:12,214 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:34:12,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:34:12,425 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-09 22:34:12,425 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:34:12,438 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:34:12,439 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:34:12,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:12 BoogieIcfgContainer [2025-01-09 22:34:12,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:34:12,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:34:12,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:34:12,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:34:12,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:11" (1/3) ... [2025-01-09 22:34:12,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec104b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:12, skipping insertion in model container [2025-01-09 22:34:12,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:12" (2/3) ... [2025-01-09 22:34:12,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec104b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:12, skipping insertion in model container [2025-01-09 22:34:12,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:12" (3/3) ... [2025-01-09 22:34:12,447 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-before.i [2025-01-09 22:34:12,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:34:12,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-shared-sll-before.i that has 3 procedures, 87 locations, 1 initial locations, 4 loop locations, and 31 error locations. [2025-01-09 22:34:12,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:34:12,502 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;@21e37bed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:34:12,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 22:34:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 80 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:34:12,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:12,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:34:12,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:12,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 37389497, now seen corresponding path program 1 times [2025-01-09 22:34:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:12,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196936433] [2025-01-09 22:34:12,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:12,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:34:12,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:34:12,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:12,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,682 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:34:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196936433] [2025-01-09 22:34:12,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196936433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:12,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:12,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507856185] [2025-01-09 22:34:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:12,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:12,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:12,714 INFO L87 Difference]: Start difference. First operand has 87 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 80 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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:34:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:12,799 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2025-01-09 22:34:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:12,802 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:34:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:12,807 INFO L225 Difference]: With dead ends: 86 [2025-01-09 22:34:12,808 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 22:34:12,809 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:34:12,812 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:12,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 144 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 22:34:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 22:34:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.6875) internal successors, (81), 77 states have internal predecessors, (81), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-01-09 22:34:12,845 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2025-01-09 22:34:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:12,845 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-01-09 22:34:12,846 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:34:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2025-01-09 22:34:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:34:12,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:12,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:34:12,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:34:12,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 37389498, now seen corresponding path program 1 times [2025-01-09 22:34:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973723910] [2025-01-09 22:34:12,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:12,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:34:12,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:34:12,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:12,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:12,941 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:34:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973723910] [2025-01-09 22:34:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973723910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695435116] [2025-01-09 22:34:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:12,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:12,944 INFO L87 Difference]: Start difference. First operand 84 states and 89 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:34:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:12,992 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-01-09 22:34:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:12,993 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:34:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:12,994 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:34:12,994 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:34:12,994 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:34:12,995 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:12,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:34:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 22:34:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-01-09 22:34:13,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 5 [2025-01-09 22:34:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:13,008 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-01-09 22:34:13,008 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:34:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-01-09 22:34:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:34:13,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:13,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:34:13,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:13,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -963137170, now seen corresponding path program 1 times [2025-01-09 22:34:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564438341] [2025-01-09 22:34:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:13,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:34:13,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:34:13,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,089 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:34:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564438341] [2025-01-09 22:34:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564438341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997511780] [2025-01-09 22:34:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:13,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:13,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:13,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:13,092 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:13,135 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-01-09 22:34:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:13,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-09 22:34:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:13,136 INFO L225 Difference]: With dead ends: 81 [2025-01-09 22:34:13,136 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 22:34:13,136 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:34:13,137 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:13,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 22:34:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 22:34:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.625) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-01-09 22:34:13,141 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 16 [2025-01-09 22:34:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:13,144 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-01-09 22:34:13,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-01-09 22:34:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:34:13,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:13,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:13,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:34:13,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -963137169, now seen corresponding path program 1 times [2025-01-09 22:34:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897682485] [2025-01-09 22:34:13,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:13,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:34:13,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:34:13,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,263 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:34:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897682485] [2025-01-09 22:34:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897682485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871849065] [2025-01-09 22:34:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:13,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:13,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:13,266 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:13,302 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-01-09 22:34:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:13,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-09 22:34:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:13,305 INFO L225 Difference]: With dead ends: 79 [2025-01-09 22:34:13,305 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 22:34:13,305 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:34:13,305 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:13,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 22:34:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 22:34:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2025-01-09 22:34:13,316 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 16 [2025-01-09 22:34:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:13,318 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2025-01-09 22:34:13,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2025-01-09 22:34:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:13,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:13,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:13,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:34:13,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1671862765, now seen corresponding path program 1 times [2025-01-09 22:34:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676376896] [2025-01-09 22:34:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:13,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:13,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:13,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:13,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676376896] [2025-01-09 22:34:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676376896] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484605910] [2025-01-09 22:34:13,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:13,561 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:34:13,563 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:34:13,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:13,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:13,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:13,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:13,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:34:13,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:13,663 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:34:13,694 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:34:13,718 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:34:13,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:34:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:34:13,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:13,865 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:34:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484605910] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:13,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-01-09 22:34:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930720994] [2025-01-09 22:34:13,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:34:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:13,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:34:13,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:34:13,868 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:34:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:14,144 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2025-01-09 22:34:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:14,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2025-01-09 22:34:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:14,145 INFO L225 Difference]: With dead ends: 84 [2025-01-09 22:34:14,145 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 22:34:14,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:34:14,146 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:14,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 450 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2025-01-09 22:34:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 22:34:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-01-09 22:34:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 74 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-01-09 22:34:14,157 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 18 [2025-01-09 22:34:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:14,159 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-01-09 22:34:14,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:34:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-01-09 22:34:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:14,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:14,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:14,170 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:34:14,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:14,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:14,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1671862766, now seen corresponding path program 1 times [2025-01-09 22:34:14,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:14,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538053240] [2025-01-09 22:34:14,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:14,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:14,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:14,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:14,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:14,631 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:34:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538053240] [2025-01-09 22:34:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538053240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648610408] [2025-01-09 22:34:14,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:14,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:14,634 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:34:14,635 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:34:14,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:14,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:14,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:34:14,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:14,691 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:34:14,845 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:34:14,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:14,877 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:34:14,884 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:14,884 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:34:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:34:14,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648610408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:15,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-01-09 22:34:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580416918] [2025-01-09 22:34:15,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:34:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:34:15,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2025-01-09 22:34:15,007 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 13 states have internal predecessors, (26), 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:34:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:15,286 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-01-09 22:34:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:34:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 13 states have internal predecessors, (26), 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 18 [2025-01-09 22:34:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:15,287 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:34:15,287 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:34:15,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=320, Unknown=1, NotChecked=36, Total=420 [2025-01-09 22:34:15,289 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:15,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 464 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 329 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2025-01-09 22:34:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:34:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-01-09 22:34:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 73 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2025-01-09 22:34:15,294 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 18 [2025-01-09 22:34:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:15,294 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2025-01-09 22:34:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 13 states have internal predecessors, (26), 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:34:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2025-01-09 22:34:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:34:15,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:15,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:15,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:34:15,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:15,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:15,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -174999703, now seen corresponding path program 1 times [2025-01-09 22:34:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868845780] [2025-01-09 22:34:15,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:15,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:15,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:34:15,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:34:15,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:15,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:15,552 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:34:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868845780] [2025-01-09 22:34:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868845780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:15,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:15,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318271196] [2025-01-09 22:34:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:15,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:15,554 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:34:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:15,631 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-01-09 22:34:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2025-01-09 22:34:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:15,634 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:34:15,634 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:34:15,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:15,634 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 11 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:15,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 237 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:34:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2025-01-09 22:34:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-01-09 22:34:15,639 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 22 [2025-01-09 22:34:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:15,639 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-01-09 22:34:15,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:34:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-01-09 22:34:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:34:15,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:15,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:15,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:34:15,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:15,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -174999702, now seen corresponding path program 1 times [2025-01-09 22:34:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660024803] [2025-01-09 22:34:15,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:15,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:34:15,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:34:15,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:15,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:15,770 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:34:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660024803] [2025-01-09 22:34:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660024803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:34:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273057819] [2025-01-09 22:34:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:15,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:15,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:15,771 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:34:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:15,840 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-01-09 22:34:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:34:15,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2025-01-09 22:34:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:15,841 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:34:15,841 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:34:15,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:15,841 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:15,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 274 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:34:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2025-01-09 22:34:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-01-09 22:34:15,846 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2025-01-09 22:34:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:15,846 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-01-09 22:34:15,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:34:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-01-09 22:34:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:34:15,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:15,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:15,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:34:15,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:15,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash 703031121, now seen corresponding path program 1 times [2025-01-09 22:34:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258762404] [2025-01-09 22:34:15,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:15,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:34:15,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:34:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:16,030 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:34:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258762404] [2025-01-09 22:34:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258762404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:34:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517007875] [2025-01-09 22:34:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:16,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:34:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:16,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:34:16,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:34:16,032 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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:34:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:16,269 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2025-01-09 22:34:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:16,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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 28 [2025-01-09 22:34:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:16,270 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:34:16,271 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:34:16,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:34:16,271 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:16,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 360 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:34:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 22:34:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 70 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2025-01-09 22:34:16,274 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 28 [2025-01-09 22:34:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:16,274 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2025-01-09 22:34:16,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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:34:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2025-01-09 22:34:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:34:16,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:16,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:16,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:34:16,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash 703031122, now seen corresponding path program 1 times [2025-01-09 22:34:16,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:16,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604490796] [2025-01-09 22:34:16,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:16,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:16,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:34:16,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:34:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:16,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:16,599 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:34:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604490796] [2025-01-09 22:34:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604490796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:16,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:16,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 22:34:16,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705722456] [2025-01-09 22:34:16,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:16,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:34:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:16,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:34:16,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:34:16,601 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:34:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:16,859 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2025-01-09 22:34:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:34:16,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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 28 [2025-01-09 22:34:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:16,861 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:34:16,864 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:34:16,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:34:16,865 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:16,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 369 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:34:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-01-09 22:34:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2025-01-09 22:34:16,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 28 [2025-01-09 22:34:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:16,872 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2025-01-09 22:34:16,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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:34:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2025-01-09 22:34:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:16,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:16,873 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:34:16,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:16,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash -350589435, now seen corresponding path program 1 times [2025-01-09 22:34:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898850891] [2025-01-09 22:34:16,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:16,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:16,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:16,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:16,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898850891] [2025-01-09 22:34:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898850891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376298437] [2025-01-09 22:34:17,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:17,053 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:34:17,055 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:34:17,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:17,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:17,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:17,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:17,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:34:17,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:17,126 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:34:17,138 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:34:17,146 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:34:17,159 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-01-09 22:34:17,174 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:34:17,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:34:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:34:17,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376298437] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:17,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-01-09 22:34:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279125451] [2025-01-09 22:34:17,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:17,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:34:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:17,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:34:17,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-01-09 22:34:17,319 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:34:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:17,546 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2025-01-09 22:34:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2025-01-09 22:34:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:17,547 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:34:17,548 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:34:17,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-01-09 22:34:17,549 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:17,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 489 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2025-01-09 22:34:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:34:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 22:34:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 81 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2025-01-09 22:34:17,553 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 30 [2025-01-09 22:34:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:17,553 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2025-01-09 22:34:17,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:34:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2025-01-09 22:34:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:17,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:17,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:17,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:34:17,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:17,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:17,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -350589434, now seen corresponding path program 1 times [2025-01-09 22:34:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668761270] [2025-01-09 22:34:17,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:17,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:17,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:17,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:17,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668761270] [2025-01-09 22:34:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668761270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996417412] [2025-01-09 22:34:18,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:18,070 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:34:18,072 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:34:18,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:18,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:18,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:34:18,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:18,142 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:34:18,144 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:34:18,221 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:34:18,225 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:34:18,256 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 26 treesize of output 14 [2025-01-09 22:34:18,321 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:34:18,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:18,343 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:34:18,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:18,349 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:34:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:34:18,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996417412] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:18,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-01-09 22:34:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869839086] [2025-01-09 22:34:18,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:18,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:34:18,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:18,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:34:18,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:34:18,466 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:34:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:18,769 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-01-09 22:34:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2025-01-09 22:34:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:18,770 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:34:18,770 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:34:18,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=562, Unknown=1, NotChecked=48, Total=702 [2025-01-09 22:34:18,771 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 11 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:18,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 441 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 311 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2025-01-09 22:34:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:34:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-01-09 22:34:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.375) internal successors, (88), 79 states have internal predecessors, (88), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2025-01-09 22:34:18,777 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 30 [2025-01-09 22:34:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:18,777 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2025-01-09 22:34:18,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:34:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2025-01-09 22:34:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:18,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:18,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:18,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:18,978 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,SelfDestructingSolverStorable11 [2025-01-09 22:34:18,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:18,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1303413939, now seen corresponding path program 1 times [2025-01-09 22:34:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516258013] [2025-01-09 22:34:18,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:18,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:18,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,045 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:34:19,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:19,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516258013] [2025-01-09 22:34:19,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516258013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:19,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:19,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290275566] [2025-01-09 22:34:19,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:19,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:19,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:19,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:19,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:19,046 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 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:34:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:19,088 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2025-01-09 22:34:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 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:34:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:19,089 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:34:19,089 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:34:19,089 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:34:19,090 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 25 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:19,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 479 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:34:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2025-01-09 22:34:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 79 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:34:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2025-01-09 22:34:19,094 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 30 [2025-01-09 22:34:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:19,094 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2025-01-09 22:34:19,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 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:34:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2025-01-09 22:34:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:34:19,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:19,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:19,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:34:19,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1369306394, now seen corresponding path program 1 times [2025-01-09 22:34:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:19,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073785515] [2025-01-09 22:34:19,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:19,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:19,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:19,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073785515] [2025-01-09 22:34:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073785515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142109037] [2025-01-09 22:34:19,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:19,214 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:34:19,216 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:34:19,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:19,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:19,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:19,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:34:19,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:19,302 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:34:19,335 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:19,335 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:34:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:19,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:34:19,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142109037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:19,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:34:19,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-01-09 22:34:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220408384] [2025-01-09 22:34:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:19,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:19,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-01-09 22:34:19,338 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:19,381 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2025-01-09 22:34:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:19,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-01-09 22:34:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:19,382 INFO L225 Difference]: With dead ends: 93 [2025-01-09 22:34:19,382 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 22:34:19,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-01-09 22:34:19,383 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:19,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 95 Unchecked, 0.0s Time] [2025-01-09 22:34:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 22:34:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-01-09 22:34:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2025-01-09 22:34:19,387 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 32 [2025-01-09 22:34:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:19,387 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2025-01-09 22:34:19,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2025-01-09 22:34:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:34:19,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:19,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:19,394 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:34:19,588 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,SelfDestructingSolverStorable13 [2025-01-09 22:34:19,589 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1369306393, now seen corresponding path program 1 times [2025-01-09 22:34:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070601114] [2025-01-09 22:34:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:19,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:19,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:19,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:19,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070601114] [2025-01-09 22:34:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070601114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704261047] [2025-01-09 22:34:19,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:19,805 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:34:19,807 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:34:19,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:19,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:19,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:19,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:19,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:34:19,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:19,885 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:34:19,960 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:34:19,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:19,987 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:34:19,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:19,994 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:34:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 22:34:19,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704261047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:20,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-01-09 22:34:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835257189] [2025-01-09 22:34:20,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:34:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:34:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:34:20,075 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:34:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:20,285 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2025-01-09 22:34:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:20,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2025-01-09 22:34:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:20,287 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:34:20,287 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:34:20,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:34:20,287 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 21 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:20,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 412 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 85 Unchecked, 0.1s Time] [2025-01-09 22:34:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:34:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-01-09 22:34:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 87 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-01-09 22:34:20,292 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 32 [2025-01-09 22:34:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:20,292 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-01-09 22:34:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:34:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2025-01-09 22:34:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:34:20,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,295 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:34:20,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:20,499 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,SelfDestructingSolverStorable14 [2025-01-09 22:34:20,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:20,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1739643108, now seen corresponding path program 1 times [2025-01-09 22:34:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427712660] [2025-01-09 22:34:20,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:34:20,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:34:20,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,595 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:34:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427712660] [2025-01-09 22:34:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427712660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33830201] [2025-01-09 22:34:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:20,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:20,597 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 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:34:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:20,686 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-01-09 22:34:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:20,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 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 31 [2025-01-09 22:34:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:20,688 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:34:20,688 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:34:20,688 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:34:20,688 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 21 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:20,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 400 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:34:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-01-09 22:34:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 90 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-01-09 22:34:20,692 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 31 [2025-01-09 22:34:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:20,692 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-01-09 22:34:20,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 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:34:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-01-09 22:34:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:34:20,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:20,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:34:20,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:20,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 592621594, now seen corresponding path program 1 times [2025-01-09 22:34:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204567771] [2025-01-09 22:34:20,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:34:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:34:20,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204567771] [2025-01-09 22:34:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204567771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679702542] [2025-01-09 22:34:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:20,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:20,840 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:34:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:20,912 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-01-09 22:34:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:20,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-01-09 22:34:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:20,913 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:34:20,913 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:34:20,914 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:34:20,914 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:20,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 306 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:34:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:34:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.32) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-01-09 22:34:20,916 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 35 [2025-01-09 22:34:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:20,916 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-01-09 22:34:20,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:34:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-01-09 22:34:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:34:20,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:34:20,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:20,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 592621593, now seen corresponding path program 1 times [2025-01-09 22:34:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12791854] [2025-01-09 22:34:20,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:34:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:34:20,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:34:20,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12791854] [2025-01-09 22:34:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12791854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:34:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978409715] [2025-01-09 22:34:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:20,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:20,997 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:34:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:21,074 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2025-01-09 22:34:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-01-09 22:34:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:21,075 INFO L225 Difference]: With dead ends: 97 [2025-01-09 22:34:21,075 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 22:34:21,075 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:34:21,076 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:21,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 280 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 22:34:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 22:34:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 88 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2025-01-09 22:34:21,078 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 35 [2025-01-09 22:34:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2025-01-09 22:34:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:34:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2025-01-09 22:34:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:34:21,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:21,078 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] [2025-01-09 22:34:21,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:34:21,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1662412554, now seen corresponding path program 1 times [2025-01-09 22:34:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529675193] [2025-01-09 22:34:21,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:21,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:34:21,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:34:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:21,623 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:34:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529675193] [2025-01-09 22:34:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529675193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713533599] [2025-01-09 22:34:21,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:21,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:21,626 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:34:21,628 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:34:21,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:34:21,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:34:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:21,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 22:34:21,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:21,710 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:34:21,738 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:34:21,743 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:34:21,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:21,995 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:34:21,999 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:34:22,007 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:34:22,075 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:34:22,078 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:34:22,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:22,166 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 15 treesize of output 15 [2025-01-09 22:34:22,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:22,176 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 15 treesize of output 15 [2025-01-09 22:34:22,277 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:34:22,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:22,384 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_535 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2025-01-09 22:34:22,391 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_535 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_536 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2025-01-09 22:34:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713533599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:22,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 33 [2025-01-09 22:34:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456260093] [2025-01-09 22:34:22,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:22,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:34:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:22,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:34:22,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1180, Unknown=2, NotChecked=138, Total=1406 [2025-01-09 22:34:22,539 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 33 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 28 states have internal predecessors, (51), 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:34:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:23,369 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-01-09 22:34:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:34:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 28 states have internal predecessors, (51), 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 34 [2025-01-09 22:34:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:23,370 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:34:23,370 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:34:23,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=2110, Unknown=2, NotChecked=186, Total=2450 [2025-01-09 22:34:23,371 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:23,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1063 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:34:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:34:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-01-09 22:34:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 91 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-01-09 22:34:23,376 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 34 [2025-01-09 22:34:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:23,376 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-01-09 22:34:23,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 28 states have internal predecessors, (51), 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:34:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-01-09 22:34:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:23,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:23,377 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:34:23,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:23,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:23,578 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:23,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 149741848, now seen corresponding path program 1 times [2025-01-09 22:34:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153994141] [2025-01-09 22:34:23,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:23,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:23,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:23,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:23,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:23,806 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:34:23,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:23,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153994141] [2025-01-09 22:34:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153994141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:23,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452930654] [2025-01-09 22:34:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:23,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:23,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:23,809 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:34:23,810 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:34:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:23,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:23,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:23,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:23,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 22:34:23,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:23,895 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:34:23,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:23,940 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:34:23,996 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:34:24,001 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:34:24,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:24,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:24,078 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 17 treesize of output 21 [2025-01-09 22:34:24,237 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:34:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452930654] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:24,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 27 [2025-01-09 22:34:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783573849] [2025-01-09 22:34:24,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:24,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:34:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:24,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:34:24,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:34:24,239 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 28 states, 25 states have (on average 2.04) internal successors, (51), 22 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:34:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:24,782 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2025-01-09 22:34:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:34:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.04) internal successors, (51), 22 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2025-01-09 22:34:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:24,784 INFO L225 Difference]: With dead ends: 127 [2025-01-09 22:34:24,784 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 22:34:24,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:34:24,785 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 80 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:24,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 543 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 22:34:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2025-01-09 22:34:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 105 states have internal predecessors, (120), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2025-01-09 22:34:24,790 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 36 [2025-01-09 22:34:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:24,791 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2025-01-09 22:34:24,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.04) internal successors, (51), 22 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:34:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2025-01-09 22:34:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:34:24,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:24,791 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:34:24,798 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:34:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:24,996 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 149741849, now seen corresponding path program 1 times [2025-01-09 22:34:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020094117] [2025-01-09 22:34:24,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:34:25,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:34:25,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,126 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:34:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020094117] [2025-01-09 22:34:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020094117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467966420] [2025-01-09 22:34:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:25,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,127 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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:34:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,239 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2025-01-09 22:34:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 36 [2025-01-09 22:34:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,241 INFO L225 Difference]: With dead ends: 141 [2025-01-09 22:34:25,241 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 22:34:25,241 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:34:25,242 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 363 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 22:34:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-01-09 22:34:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 128 states have internal predecessors, (154), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2025-01-09 22:34:25,248 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 36 [2025-01-09 22:34:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,248 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2025-01-09 22:34:25,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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:34:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2025-01-09 22:34:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:34:25,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,249 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:34:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:34:25,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 347042009, now seen corresponding path program 1 times [2025-01-09 22:34:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879113300] [2025-01-09 22:34:25,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:34:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:34:25,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,310 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:34:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879113300] [2025-01-09 22:34:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879113300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609232093] [2025-01-09 22:34:25,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:25,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:25,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,312 INFO L87 Difference]: Start difference. First operand 137 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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:34:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,357 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2025-01-09 22:34:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:25,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 37 [2025-01-09 22:34:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,360 INFO L225 Difference]: With dead ends: 144 [2025-01-09 22:34:25,360 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 22:34:25,361 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:34:25,362 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 449 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 22:34:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2025-01-09 22:34:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 129 states have internal predecessors, (152), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:34:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2025-01-09 22:34:25,366 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 37 [2025-01-09 22:34:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,366 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2025-01-09 22:34:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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:34:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2025-01-09 22:34:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:34:25,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,366 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, 1] [2025-01-09 22:34:25,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:34:25,367 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:25,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1760363158, now seen corresponding path program 1 times [2025-01-09 22:34:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636002084] [2025-01-09 22:34:25,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:34:25,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:34:25,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,632 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:34:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636002084] [2025-01-09 22:34:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636002084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12933978] [2025-01-09 22:34:25,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:25,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:25,634 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:34:25,636 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:34:25,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:34:25,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:34:25,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 22:34:25,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:25,725 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:34:25,731 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:34:25,839 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:34:25,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:25,854 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:34:25,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:25,861 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:34:25,920 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:34:25,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:25,937 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:34:25,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:25,942 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:34:25,958 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:34:25,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12933978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:26,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2025-01-09 22:34:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199137172] [2025-01-09 22:34:26,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:34:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:34:26,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=453, Unknown=2, NotChecked=86, Total=600 [2025-01-09 22:34:26,066 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 22 states, 20 states have (on average 2.65) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,404 INFO L93 Difference]: Finished difference Result 160 states and 192 transitions. [2025-01-09 22:34:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 22:34:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-01-09 22:34:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,405 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:34:26,405 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 22:34:26,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=678, Unknown=2, NotChecked=106, Total=870 [2025-01-09 22:34:26,405 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 668 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 594 Invalid, 0 Unknown, 199 Unchecked, 0.2s Time] [2025-01-09 22:34:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 22:34:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2025-01-09 22:34:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 147 states have internal predecessors, (172), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:34:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 188 transitions. [2025-01-09 22:34:26,410 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 188 transitions. Word has length 40 [2025-01-09 22:34:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,410 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 188 transitions. [2025-01-09 22:34:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 188 transitions. [2025-01-09 22:34:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:34:26,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,410 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:34:26,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:26,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:26,613 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:26,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1511556209, now seen corresponding path program 1 times [2025-01-09 22:34:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682676353] [2025-01-09 22:34:26,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:34:26,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:26,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,690 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:34:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682676353] [2025-01-09 22:34:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682676353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536938787] [2025-01-09 22:34:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:26,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:26,693 INFO L87 Difference]: Start difference. First operand 158 states and 188 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:34:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,764 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2025-01-09 22:34:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 39 [2025-01-09 22:34:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,765 INFO L225 Difference]: With dead ends: 163 [2025-01-09 22:34:26,765 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 22:34:26,765 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:34:26,766 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 396 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 22:34:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2025-01-09 22:34:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 151 states have internal predecessors, (179), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:34:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2025-01-09 22:34:26,780 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 39 [2025-01-09 22:34:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,781 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2025-01-09 22:34:26,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:34:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2025-01-09 22:34:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:26,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,781 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] [2025-01-09 22:34:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:34:26,782 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1961211965, now seen corresponding path program 1 times [2025-01-09 22:34:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049384048] [2025-01-09 22:34:26,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:26,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:26,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049384048] [2025-01-09 22:34:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049384048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164193670] [2025-01-09 22:34:27,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:27,097 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:34:27,099 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:34:27,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:27,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:27,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:27,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 22:34:27,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:27,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:27,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:27,195 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:34:27,199 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:34:27,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:27,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:34:27,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:27,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 22:34:27,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:27,374 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 15 treesize of output 15 [2025-01-09 22:34:27,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:27,384 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 15 treesize of output 15 [2025-01-09 22:34:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:27,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:27,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-01-09 22:34:27,979 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 102 treesize of output 98 [2025-01-09 22:34:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:27,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164193670] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:27,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:27,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 29 [2025-01-09 22:34:27,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412733666] [2025-01-09 22:34:27,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 22:34:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:27,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 22:34:27,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2025-01-09 22:34:27,995 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 26 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:34:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:28,406 INFO L93 Difference]: Finished difference Result 169 states and 198 transitions. [2025-01-09 22:34:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:34:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 26 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-01-09 22:34:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:28,407 INFO L225 Difference]: With dead ends: 169 [2025-01-09 22:34:28,407 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 22:34:28,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:34:28,408 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 21 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:28,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1280 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 22:34:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2025-01-09 22:34:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 154 states have internal predecessors, (182), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 22:34:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2025-01-09 22:34:28,410 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 42 [2025-01-09 22:34:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:28,411 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2025-01-09 22:34:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 26 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:34:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2025-01-09 22:34:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:34:28,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:28,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:28,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:34:28,612 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -532381162, now seen corresponding path program 1 times [2025-01-09 22:34:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547847179] [2025-01-09 22:34:28,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:28,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:34:28,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:34:28,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:28,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:28,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:28,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547847179] [2025-01-09 22:34:28,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547847179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:28,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522538899] [2025-01-09 22:34:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:28,977 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:34:28,979 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:34:29,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:34:29,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:34:29,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 22:34:29,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:29,081 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:34:29,085 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:34:29,295 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:29,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:34:29,309 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:34:29,310 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:34:29,436 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:29,436 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:34:29,455 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:34:29,455 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:34:29,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:34:29,528 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 17 treesize of output 9 [2025-01-09 22:34:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:29,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522538899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:29,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2025-01-09 22:34:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307240698] [2025-01-09 22:34:29,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:34:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:29,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:34:29,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:34:29,732 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 26 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,332 INFO L93 Difference]: Finished difference Result 201 states and 238 transitions. [2025-01-09 22:34:30,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:34:30,332 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 26 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-01-09 22:34:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,333 INFO L225 Difference]: With dead ends: 201 [2025-01-09 22:34:30,333 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 22:34:30,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1962, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 22:34:30,334 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 92 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:30,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 648 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 22:34:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2025-01-09 22:34:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 172 states have (on average 1.2674418604651163) internal successors, (218), 184 states have internal predecessors, (218), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2025-01-09 22:34:30,341 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 44 [2025-01-09 22:34:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,341 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2025-01-09 22:34:30,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 26 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2025-01-09 22:34:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:34:30,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,349 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:34:30,546 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,SelfDestructingSolverStorable25 [2025-01-09 22:34:30,546 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash 668040788, now seen corresponding path program 1 times [2025-01-09 22:34:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210537795] [2025-01-09 22:34:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:34:30,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:34:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,869 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:34:30,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210537795] [2025-01-09 22:34:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210537795] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942393726] [2025-01-09 22:34:30,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:30,871 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:34:30,872 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:34:30,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:34:30,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:34:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:34:30,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:31,217 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-01-09 22:34:31,217 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 46 [2025-01-09 22:34:31,478 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:34:31,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942393726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:31,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:31,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 31 [2025-01-09 22:34:31,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727978233] [2025-01-09 22:34:31,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:34:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:34:31,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1377, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 22:34:31,733 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 27 states have internal predecessors, (71), 3 states have call successors, (3), 1 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:34:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:32,187 INFO L93 Difference]: Finished difference Result 207 states and 247 transitions. [2025-01-09 22:34:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:34:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 27 states have internal predecessors, (71), 3 states have call successors, (3), 1 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 43 [2025-01-09 22:34:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:32,189 INFO L225 Difference]: With dead ends: 207 [2025-01-09 22:34:32,189 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 22:34:32,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=1377, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 22:34:32,193 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:32,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 749 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1101 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 22:34:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-01-09 22:34:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 175 states have internal predecessors, (208), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 228 transitions. [2025-01-09 22:34:32,197 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 228 transitions. Word has length 43 [2025-01-09 22:34:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:32,197 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 228 transitions. [2025-01-09 22:34:32,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 27 states have internal predecessors, (71), 3 states have call successors, (3), 1 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:34:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2025-01-09 22:34:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:34:32,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:32,197 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:34:32,203 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:34:32,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,398 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 438451470, now seen corresponding path program 1 times [2025-01-09 22:34:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674592000] [2025-01-09 22:34:32,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:32,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:34:32,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:34:32,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,928 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:34:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:32,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674592000] [2025-01-09 22:34:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674592000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:32,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851403048] [2025-01-09 22:34:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:32,933 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:34:32,940 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:34:33,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:34:33,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:34:33,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:33,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:34:33,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:33,026 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:34:33,182 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:34:33,182 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:34:33,219 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:34:33,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:33,365 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 26 treesize of output 19 [2025-01-09 22:34:33,382 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-01-09 22:34:33,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-01-09 22:34:33,468 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 34 treesize of output 25 [2025-01-09 22:34:33,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:33,514 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 25 treesize of output 21 [2025-01-09 22:34:33,652 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 19 treesize of output 12 [2025-01-09 22:34:33,655 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:34:33,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:33,813 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_989) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_ULTIMATE.start_main_~shared~0#1.base|))) (forall ((v_ArrVal_989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_989) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)) 1))) is different from false [2025-01-09 22:34:33,818 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_989) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)) 1)) (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_989) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_ULTIMATE.start_main_~shared~0#1.base|)))) is different from false [2025-01-09 22:34:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851403048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:33,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 41 [2025-01-09 22:34:33,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432266188] [2025-01-09 22:34:33,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:33,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:34:33,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:33,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:34:33,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2034, Unknown=4, NotChecked=182, Total=2352 [2025-01-09 22:34:33,925 INFO L87 Difference]: Start difference. First operand 188 states and 228 transitions. Second operand has 42 states, 40 states have (on average 1.825) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:34,754 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2025-01-09 22:34:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:34:34,754 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.825) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2025-01-09 22:34:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:34,755 INFO L225 Difference]: With dead ends: 198 [2025-01-09 22:34:34,755 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 22:34:34,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=3429, Unknown=4, NotChecked=238, Total=3906 [2025-01-09 22:34:34,756 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:34,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1185 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:34:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 22:34:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2025-01-09 22:34:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.281437125748503) internal successors, (214), 179 states have internal predecessors, (214), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2025-01-09 22:34:34,763 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 46 [2025-01-09 22:34:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:34,763 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2025-01-09 22:34:34,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.825) internal successors, (73), 34 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2025-01-09 22:34:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:34:34,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:34,763 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:34:34,772 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:34:34,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:34:34,964 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash 438451471, now seen corresponding path program 1 times [2025-01-09 22:34:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548687114] [2025-01-09 22:34:34,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:34,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:34,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:34:34,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:34:34,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:34,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548687114] [2025-01-09 22:34:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548687114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378617249] [2025-01-09 22:34:35,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:35,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:35,655 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:34:35,657 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:34:35,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:34:35,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:34:35,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:35,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:35,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-09 22:34:35,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:35,851 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:34:35,911 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:34:35,918 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:34:36,150 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:36,151 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:34:36,154 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:34:36,161 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:34:36,161 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 1 case distinctions, treesize of input 18 treesize of output 21 [2025-01-09 22:34:36,166 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:34:36,231 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:34:36,234 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:34:36,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:36,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 22:34:36,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:36,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-01-09 22:34:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:36,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:36,797 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1069 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1069) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)))) is different from false [2025-01-09 22:34:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378617249] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:37,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2025-01-09 22:34:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562606288] [2025-01-09 22:34:37,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:37,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 22:34:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:37,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 22:34:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2388, Unknown=24, NotChecked=98, Total=2652 [2025-01-09 22:34:37,028 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand has 43 states, 40 states have (on average 1.925) internal successors, (77), 37 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:38,272 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2025-01-09 22:34:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:34:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.925) internal successors, (77), 37 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2025-01-09 22:34:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:38,275 INFO L225 Difference]: With dead ends: 196 [2025-01-09 22:34:38,275 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 22:34:38,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=226, Invalid=3654, Unknown=30, NotChecked=122, Total=4032 [2025-01-09 22:34:38,276 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:38,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1710 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:34:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 22:34:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2025-01-09 22:34:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.272189349112426) internal successors, (215), 181 states have internal predecessors, (215), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2025-01-09 22:34:38,286 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 46 [2025-01-09 22:34:38,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:38,286 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2025-01-09 22:34:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.925) internal successors, (77), 37 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2025-01-09 22:34:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:34:38,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:38,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:38,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:34:38,488 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,SelfDestructingSolverStorable28 [2025-01-09 22:34:38,489 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:38,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1735140266, now seen corresponding path program 1 times [2025-01-09 22:34:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:38,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502477555] [2025-01-09 22:34:38,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:38,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:34:38,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:34:38,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:34:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:38,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502477555] [2025-01-09 22:34:38,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502477555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:38,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641403488] [2025-01-09 22:34:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:38,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:38,752 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:34:38,753 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:34:38,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:34:38,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:34:38,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:38,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:38,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:34:38,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:38,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:38,880 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:34:38,892 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:34:38,919 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:38,920 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 34 treesize of output 33 [2025-01-09 22:34:38,925 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 25 treesize of output 13 [2025-01-09 22:34:38,933 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:34:38,958 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:38,958 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:34:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2025-01-09 22:34:38,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641403488] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:38,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2025-01-09 22:34:38,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902732280] [2025-01-09 22:34:38,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:38,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:34:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:38,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:34:38,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2025-01-09 22:34:38,993 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 19 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 22:34:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:39,217 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2025-01-09 22:34:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 19 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2025-01-09 22:34:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:39,218 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:34:39,218 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:34:39,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=662, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:34:39,219 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:39,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 727 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 489 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2025-01-09 22:34:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:34:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 22:34:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 180 states have internal predecessors, (213), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2025-01-09 22:34:39,222 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 48 [2025-01-09 22:34:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:39,222 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2025-01-09 22:34:39,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 19 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 22:34:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2025-01-09 22:34:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:34:39,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:39,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:39,230 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:34:39,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:39,424 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:39,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1735140267, now seen corresponding path program 1 times [2025-01-09 22:34:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391047934] [2025-01-09 22:34:39,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:39,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:39,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:34:39,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:34:39,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:39,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391047934] [2025-01-09 22:34:39,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391047934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570545859] [2025-01-09 22:34:39,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:39,769 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:34:39,770 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:34:39,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:34:39,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:34:39,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:39,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:39,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:34:39,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:39,892 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:34:39,916 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:39,916 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:34:39,924 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:34:39,926 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:34:39,966 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:39,967 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 59 treesize of output 52 [2025-01-09 22:34:39,972 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 24 treesize of output 11 [2025-01-09 22:34:40,000 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 34 treesize of output 18 [2025-01-09 22:34:40,003 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 7 treesize of output 3 [2025-01-09 22:34:40,061 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:34:40,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:40,076 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:34:40,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:40,082 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:34:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 22:34:40,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570545859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:40,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:40,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2025-01-09 22:34:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437614859] [2025-01-09 22:34:40,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:34:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:40,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:34:40,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=583, Unknown=1, NotChecked=48, Total=702 [2025-01-09 22:34:40,148 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:40,478 INFO L93 Difference]: Finished difference Result 190 states and 227 transitions. [2025-01-09 22:34:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:34:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-01-09 22:34:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:40,483 INFO L225 Difference]: With dead ends: 190 [2025-01-09 22:34:40,483 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 22:34:40,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1049, Unknown=1, NotChecked=66, Total=1260 [2025-01-09 22:34:40,483 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:40,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 693 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2025-01-09 22:34:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 22:34:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-01-09 22:34:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2248520710059172) internal successors, (207), 177 states have internal predecessors, (207), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 227 transitions. [2025-01-09 22:34:40,491 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 227 transitions. Word has length 48 [2025-01-09 22:34:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:40,491 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 227 transitions. [2025-01-09 22:34:40,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 227 transitions. [2025-01-09 22:34:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:34:40,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:40,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:40,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-09 22:34:40,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:40,692 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:40,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash 912248327, now seen corresponding path program 1 times [2025-01-09 22:34:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896922941] [2025-01-09 22:34:40,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:40,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:34:40,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:34:40,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:40,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:41,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896922941] [2025-01-09 22:34:41,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896922941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:41,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044225721] [2025-01-09 22:34:41,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:41,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:41,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:41,048 INFO L229 MonitoredProcess]: Starting monitored process 18 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:34:41,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:34:41,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:34:41,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:34:41,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:41,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:41,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:34:41,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:41,288 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:34:41,365 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 9 treesize of output 5 [2025-01-09 22:34:41,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:41,408 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:34:41,411 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:34:41,465 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:34:41,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:41,515 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 17 [2025-01-09 22:34:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:41,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:41,707 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:34:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044225721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:41,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2025-01-09 22:34:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393289358] [2025-01-09 22:34:41,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:41,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:34:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:41,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:34:41,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1452, Unknown=15, NotChecked=76, Total=1640 [2025-01-09 22:34:41,810 INFO L87 Difference]: Start difference. First operand 190 states and 227 transitions. Second operand has 36 states, 33 states have (on average 2.121212121212121) internal successors, (70), 30 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:42,513 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2025-01-09 22:34:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:34:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.121212121212121) internal successors, (70), 30 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2025-01-09 22:34:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:42,514 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:34:42,514 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:34:42,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=2772, Unknown=16, NotChecked=106, Total=3080 [2025-01-09 22:34:42,515 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 21 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:42,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1481 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:34:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-01-09 22:34:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.223529411764706) internal successors, (208), 178 states have internal predecessors, (208), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2025-01-09 22:34:42,520 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 49 [2025-01-09 22:34:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:42,520 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2025-01-09 22:34:42,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.121212121212121) internal successors, (70), 30 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2025-01-09 22:34:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:34:42,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:42,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:42,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:42,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:42,725 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1003524282, now seen corresponding path program 1 times [2025-01-09 22:34:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513677118] [2025-01-09 22:34:42,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:42,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:34:42,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:34:42,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:42,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:43,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513677118] [2025-01-09 22:34:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513677118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600698698] [2025-01-09 22:34:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:43,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:43,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:43,594 INFO L229 MonitoredProcess]: Starting monitored process 19 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:34:43,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:34:43,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:34:43,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:34:43,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:43,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:43,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-01-09 22:34:43,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:43,707 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:34:43,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:43,732 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:34:44,005 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:44,006 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:34:44,017 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:44,017 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:34:44,021 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:34:44,082 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:34:44,086 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:34:44,155 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:44,155 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:34:44,166 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:44,166 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:34:44,174 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:44,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:44,207 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:34:44,211 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:34:44,313 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-01-09 22:34:44,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2025-01-09 22:34:44,320 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 20 treesize of output 11 [2025-01-09 22:34:44,324 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 12 treesize of output 8 [2025-01-09 22:34:44,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:44,413 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 15 treesize of output 15 [2025-01-09 22:34:44,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:44,419 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 15 treesize of output 15 [2025-01-09 22:34:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:44,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:44,593 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_1458 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2025-01-09 22:34:44,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~now~1#1.offset|))) (and (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1457) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_1458 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1458) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)))) is different from false [2025-01-09 22:34:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600698698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:44,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:44,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 45 [2025-01-09 22:34:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432443003] [2025-01-09 22:34:44,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:44,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 22:34:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:44,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 22:34:44,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2180, Unknown=45, NotChecked=190, Total=2550 [2025-01-09 22:34:44,811 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 45 states, 43 states have (on average 1.813953488372093) internal successors, (78), 38 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:45,818 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2025-01-09 22:34:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:34:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.813953488372093) internal successors, (78), 38 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2025-01-09 22:34:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:45,819 INFO L225 Difference]: With dead ends: 196 [2025-01-09 22:34:45,819 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 22:34:45,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=3977, Unknown=57, NotChecked=258, Total=4556 [2025-01-09 22:34:45,820 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:45,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1159 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:34:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 22:34:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2025-01-09 22:34:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.2196531791907514) internal successors, (211), 181 states have internal predecessors, (211), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:34:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2025-01-09 22:34:45,824 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 50 [2025-01-09 22:34:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:45,824 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2025-01-09 22:34:45,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.813953488372093) internal successors, (78), 38 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:34:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2025-01-09 22:34:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:34:45,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:45,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:45,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 22:34:46,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:46,026 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:46,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1110036606, now seen corresponding path program 2 times [2025-01-09 22:34:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628175183] [2025-01-09 22:34:46,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:46,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:34:46,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:34:46,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:46,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628175183] [2025-01-09 22:34:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628175183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916703728] [2025-01-09 22:34:46,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:46,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:46,343 INFO L229 MonitoredProcess]: Starting monitored process 20 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:34:46,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 22:34:46,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:34:46,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:34:46,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:46,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:46,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 22:34:46,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:46,561 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-01-09 22:34:46,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:46,581 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:34:46,587 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:46,587 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:34:46,641 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:46,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:34:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:34:46,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916703728] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:46,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:46,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2025-01-09 22:34:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561780339] [2025-01-09 22:34:46,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:46,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:34:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:46,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:34:46,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=678, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:34:46,835 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 26 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:34:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:47,231 INFO L93 Difference]: Finished difference Result 248 states and 294 transitions. [2025-01-09 22:34:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:34:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2025-01-09 22:34:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:47,233 INFO L225 Difference]: With dead ends: 248 [2025-01-09 22:34:47,233 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 22:34:47,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=947, Unknown=1, NotChecked=62, Total=1122 [2025-01-09 22:34:47,233 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 19 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:47,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1054 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 648 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2025-01-09 22:34:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 22:34:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2025-01-09 22:34:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 206 states have (on average 1.1990291262135921) internal successors, (247), 214 states have internal predecessors, (247), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:34:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 273 transitions. [2025-01-09 22:34:47,238 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 273 transitions. Word has length 52 [2025-01-09 22:34:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:47,239 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 273 transitions. [2025-01-09 22:34:47,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 22 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:34:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 273 transitions. [2025-01-09 22:34:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:34:47,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:47,239 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:47,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:47,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:47,440 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-09 22:34:47,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1763021581, now seen corresponding path program 2 times [2025-01-09 22:34:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:47,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608974053] [2025-01-09 22:34:47,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:47,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:34:47,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:34:47,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:47,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:48,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608974053] [2025-01-09 22:34:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608974053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:48,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662997570] [2025-01-09 22:34:48,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:48,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:48,215 INFO L229 MonitoredProcess]: Starting monitored process 21 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:34:48,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-09 22:34:48,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:34:48,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:34:48,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:48,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 22:34:48,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:48,368 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:34:48,392 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:34:48,396 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:34:48,490 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:34:48,490 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 22:34:48,503 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2025-01-09 22:34:48,503 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 1 case distinctions, treesize of input 27 treesize of output 27 [2025-01-09 22:34:49,125 INFO L349 Elim1Store]: treesize reduction 186, result has 37.2 percent of original size [2025-01-09 22:34:49,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 176 [2025-01-09 22:34:49,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:49,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 99 [2025-01-09 22:34:49,175 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:34:49,176 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 1 case distinctions, treesize of input 56 treesize of output 55 [2025-01-09 22:34:50,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:53,459 INFO L349 Elim1Store]: treesize reduction 2324, result has 18.6 percent of original size [2025-01-09 22:34:53,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 1 disjoint index pairs (out of 253 index pairs), introduced 31 new quantified variables, introduced 263 case distinctions, treesize of input 431 treesize of output 896 [2025-01-09 22:34:53,883 INFO L349 Elim1Store]: treesize reduction 80, result has 71.7 percent of original size [2025-01-09 22:34:53,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 323 treesize of output 501