./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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-ext3/getNumbers2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:23:32,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:23:32,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:23:32,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:23:32,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:23:32,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:23:32,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:23:32,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:23:32,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:23:32,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:23:32,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:23:32,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:23:32,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:23:32,797 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:23:32,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:32,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:32,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:23:32,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:23:32,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:23:32,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:23:32,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:23:32,799 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd [2025-01-09 22:23:33,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:23:33,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:23:33,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:23:33,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:23:33,038 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:23:33,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2025-01-09 22:23:34,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ba1ee3c4/ff876bf64538410289e8754a62254217/FLAG78093d483 [2025-01-09 22:23:34,508 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:23:34,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2025-01-09 22:23:34,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ba1ee3c4/ff876bf64538410289e8754a62254217/FLAG78093d483 [2025-01-09 22:23:34,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ba1ee3c4/ff876bf64538410289e8754a62254217 [2025-01-09 22:23:34,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:23:34,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:23:34,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:34,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:23:34,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:23:34,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:34,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184491ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34, skipping insertion in model container [2025-01-09 22:23:34,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:34,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:23:34,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:34,966 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:23:34,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:23:34,985 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:23:34,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34 WrapperNode [2025-01-09 22:23:34,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:23:34,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:34,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:23:34,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:23:34,991 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:23:34" (1/1) ... [2025-01-09 22:23:34,994 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:23:34" (1/1) ... [2025-01-09 22:23:35,004 INFO L138 Inliner]: procedures = 11, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2025-01-09 22:23:35,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:23:35,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:23:35,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:23:35,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:23:35,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,019 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [12, 2]. 86 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [10, 0]. The 3 writes are split as follows [1, 2]. [2025-01-09 22:23:35,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:23:35,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:23:35,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:23:35,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:23:35,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (1/1) ... [2025-01-09 22:23:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:23:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:35,060 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:23:35,067 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:23:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:23:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:23:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:23:35,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:23:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:23:35,149 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:23:35,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:23:35,283 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 22:23:35,283 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:23:35,288 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:23:35,289 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:23:35,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:35 BoogieIcfgContainer [2025-01-09 22:23:35,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:23:35,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:23:35,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:23:35,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:23:35,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:23:34" (1/3) ... [2025-01-09 22:23:35,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6850fb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:35, skipping insertion in model container [2025-01-09 22:23:35,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:23:34" (2/3) ... [2025-01-09 22:23:35,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6850fb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:23:35, skipping insertion in model container [2025-01-09 22:23:35,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:35" (3/3) ... [2025-01-09 22:23:35,295 INFO L128 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2025-01-09 22:23:35,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:23:35,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG getNumbers2.c that has 1 procedures, 25 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-01-09 22:23:35,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:23:35,333 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;@ce62cce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:23:35,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 22:23:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:23:35,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:35,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:23:35,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:35,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:23:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335460635] [2025-01-09 22:23:35,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:35,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:23:35,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:23:35,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:35,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:35,541 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:23:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335460635] [2025-01-09 22:23:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335460635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:35,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:35,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 22:23:35,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376943305] [2025-01-09 22:23:35,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:35,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:35,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:35,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:35,560 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:35,592 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-01-09 22:23:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:23:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:35,597 INFO L225 Difference]: With dead ends: 24 [2025-01-09 22:23:35,597 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 22:23:35,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:23:35,601 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:35,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 22:23:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 22:23:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-01-09 22:23:35,628 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2025-01-09 22:23:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:35,629 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-01-09 22:23:35,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-01-09 22:23:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:23:35,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:35,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:23:35,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:23:35,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:35,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:23:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630665394] [2025-01-09 22:23:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:35,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:23:35,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:23:35,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:35,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:35,731 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:23:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630665394] [2025-01-09 22:23:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630665394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541474511] [2025-01-09 22:23:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:23:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:35,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:23:35,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:35,733 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:35,775 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-01-09 22:23:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:23:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:23:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:35,776 INFO L225 Difference]: With dead ends: 25 [2025-01-09 22:23:35,776 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 22:23:35,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:23:35,777 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:35,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 22:23:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-01-09 22:23:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-01-09 22:23:35,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 4 [2025-01-09 22:23:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:35,780 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-01-09 22:23:35,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-01-09 22:23:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:23:35,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:35,780 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 22:23:35,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:23:35,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:35,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1805828105, now seen corresponding path program 1 times [2025-01-09 22:23:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:35,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622718807] [2025-01-09 22:23:35,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:35,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:23:35,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:23:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:35,957 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:23:35,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622718807] [2025-01-09 22:23:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622718807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180088269] [2025-01-09 22:23:35,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:35,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:35,959 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:23:35,961 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:23:36,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:23:36,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:23:36,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:36,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:36,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:36,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:36,104 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:23:36,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:36,176 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:23:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180088269] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:36,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:36,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2025-01-09 22:23:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743330064] [2025-01-09 22:23:36,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:36,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:23:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:36,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:23:36,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:23:36,179 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:36,317 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2025-01-09 22:23:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 22:23:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:36,317 INFO L225 Difference]: With dead ends: 31 [2025-01-09 22:23:36,317 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 22:23:36,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:23:36,318 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:36,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 47 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 22:23:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-09 22:23:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-01-09 22:23:36,321 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 7 [2025-01-09 22:23:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:36,325 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-01-09 22:23:36,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-01-09 22:23:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:23:36,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:36,326 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:36,333 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:23:36,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:36,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:36,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1103292473, now seen corresponding path program 1 times [2025-01-09 22:23:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054235531] [2025-01-09 22:23:36,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:36,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:23:36,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:23:36,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:36,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:36,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054235531] [2025-01-09 22:23:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054235531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751128433] [2025-01-09 22:23:36,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:36,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:36,607 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:23:36,609 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:23:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:23:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:23:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:36,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:23:36,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:36,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:36,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751128433] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:36,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:23:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105648260] [2025-01-09 22:23:36,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:36,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:36,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:36,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:36,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:36,720 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:36,754 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-01-09 22:23:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:23:36,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:23:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:36,756 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:23:36,757 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:23:36,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:36,758 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:36,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:23:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:23:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-01-09 22:23:36,764 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 18 [2025-01-09 22:23:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:36,764 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-01-09 22:23:36,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-01-09 22:23:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:23:36,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:36,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:36,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:36,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:36,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:36,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1855650009, now seen corresponding path program 2 times [2025-01-09 22:23:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411393215] [2025-01-09 22:23:36,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:36,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 22:23:36,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-09 22:23:36,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:36,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:37,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411393215] [2025-01-09 22:23:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411393215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204648314] [2025-01-09 22:23:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:37,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:37,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:37,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:37,085 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:37,122 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-01-09 22:23:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:23:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:37,123 INFO L225 Difference]: With dead ends: 48 [2025-01-09 22:23:37,123 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 22:23:37,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:37,124 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 27 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:23:37,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 22:23:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 22:23:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2025-01-09 22:23:37,126 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 36 [2025-01-09 22:23:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:37,127 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2025-01-09 22:23:37,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2025-01-09 22:23:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:23:37,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:37,127 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:37,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:23:37,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:37,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1855650008, now seen corresponding path program 1 times [2025-01-09 22:23:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623143645] [2025-01-09 22:23:37,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:37,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:23:37,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:23:37,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:37,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623143645] [2025-01-09 22:23:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623143645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:23:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654776532] [2025-01-09 22:23:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:37,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:37,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:37,312 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:37,374 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-01-09 22:23:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:37,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:23:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:37,375 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:23:37,375 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 22:23:37,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:23:37,375 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:37,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 24 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 22:23:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-01-09 22:23:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-01-09 22:23:37,378 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 36 [2025-01-09 22:23:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:37,378 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-01-09 22:23:37,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2025-01-09 22:23:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:37,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:37,379 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:37,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:23:37,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:37,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1690575439, now seen corresponding path program 1 times [2025-01-09 22:23:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578207549] [2025-01-09 22:23:37,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:37,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:37,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:37,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:37,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:37,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:37,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578207549] [2025-01-09 22:23:37,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578207549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:37,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:37,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448441357] [2025-01-09 22:23:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:37,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:37,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:37,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:37,430 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:37,441 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-01-09 22:23:37,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:37,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:37,442 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:23:37,442 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:23:37,442 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:23:37,443 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:37,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:23:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:23:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-01-09 22:23:37,445 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 37 [2025-01-09 22:23:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:37,445 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-01-09 22:23:37,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-01-09 22:23:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:37,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:37,446 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:23:37,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:37,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1690575438, now seen corresponding path program 1 times [2025-01-09 22:23:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-01-09 22:23:37,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:37,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:37,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:37,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:37,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:37,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:37,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107386209] [2025-01-09 22:23:37,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107386209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:37,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:37,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:23:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110202111] [2025-01-09 22:23:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:37,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:23:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:37,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:23:37,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:23:37,525 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:37,544 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2025-01-09 22:23:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:23:37,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:37,545 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:23:37,545 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 22:23:37,545 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:23:37,545 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:37,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 22:23:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-01-09 22:23:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-01-09 22:23:37,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 37 [2025-01-09 22:23:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:37,548 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-01-09 22:23:37,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2025-01-09 22:23:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:23:37,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:37,549 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:37,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:23:37,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:37,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1146395540, now seen corresponding path program 1 times [2025-01-09 22:23:37,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:37,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919205031] [2025-01-09 22:23:37,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:37,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:37,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:23:37,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:23:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919205031] [2025-01-09 22:23:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919205031] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279581547] [2025-01-09 22:23:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:37,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:37,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:37,757 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:23:37,759 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:23:37,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:23:37,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:23:37,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:37,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:37,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:23:37,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:38,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:23:38,165 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:23:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:38,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279581547] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:38,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-01-09 22:23:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612420211] [2025-01-09 22:23:38,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:38,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:23:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:38,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:23:38,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:23:38,700 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:38,873 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-01-09 22:23:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-01-09 22:23:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:38,874 INFO L225 Difference]: With dead ends: 61 [2025-01-09 22:23:38,874 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 22:23:38,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:23:38,875 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 105 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:38,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 40 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 22:23:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 22:23:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2025-01-09 22:23:38,878 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 40 [2025-01-09 22:23:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:38,878 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2025-01-09 22:23:38,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2025-01-09 22:23:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:23:38,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:38,879 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:38,884 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:23:39,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:39,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:39,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1178523410, now seen corresponding path program 1 times [2025-01-09 22:23:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553592119] [2025-01-09 22:23:39,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:23:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:23:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:39,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:39,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553592119] [2025-01-09 22:23:39,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553592119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:39,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927230184] [2025-01-09 22:23:39,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:39,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:39,205 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:23:39,211 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:23:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:23:39,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:23:39,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:39,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:39,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:23:39,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:39,291 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:23:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:39,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927230184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:39,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-09 22:23:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364489339] [2025-01-09 22:23:39,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:39,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:23:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:39,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:23:39,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:23:39,393 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:39,452 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-01-09 22:23:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:23:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:23:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:39,453 INFO L225 Difference]: With dead ends: 62 [2025-01-09 22:23:39,453 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 22:23:39,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:23:39,454 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:39,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 22:23:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 22:23:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-01-09 22:23:39,461 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 41 [2025-01-09 22:23:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:39,462 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-01-09 22:23:39,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-01-09 22:23:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:23:39,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:39,463 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:39,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:23:39,663 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,SelfDestructingSolverStorable9 [2025-01-09 22:23:39,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:39,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 838244657, now seen corresponding path program 1 times [2025-01-09 22:23:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939535265] [2025-01-09 22:23:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:39,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:23:39,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:23:39,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:39,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939535265] [2025-01-09 22:23:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939535265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723475917] [2025-01-09 22:23:39,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:39,756 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:23:39,758 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:23:39,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:23:39,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:23:39,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:39,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:23:39,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:39,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723475917] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:39,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 22:23:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749942009] [2025-01-09 22:23:39,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:39,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:23:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:39,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:23:39,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:23:39,879 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:39,931 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2025-01-09 22:23:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-01-09 22:23:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:39,932 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:23:39,932 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:23:39,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:23:39,932 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:23:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 22:23:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-01-09 22:23:39,935 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 45 [2025-01-09 22:23:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:39,935 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-01-09 22:23:39,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-01-09 22:23:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:23:39,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:39,935 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 22:23:39,943 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:23:40,142 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,SelfDestructingSolverStorable10 [2025-01-09 22:23:40,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 493940792, now seen corresponding path program 2 times [2025-01-09 22:23:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:40,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600548649] [2025-01-09 22:23:40,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:40,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:23:40,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:23:40,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:40,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600548649] [2025-01-09 22:23:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600548649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494404592] [2025-01-09 22:23:40,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:40,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:40,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:40,441 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:23:40,442 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:23:40,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-09 22:23:40,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:23:40,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:40,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:40,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:23:40,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:40,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:23:40,720 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:23:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:40,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494404592] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:41,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-01-09 22:23:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744548982] [2025-01-09 22:23:41,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:23:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:41,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:23:41,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:23:41,337 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:41,690 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2025-01-09 22:23:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:23:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 22:23:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:41,692 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:23:41,692 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:23:41,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 22:23:41,693 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 75 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:41,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 44 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:23:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 22:23:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.1875) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2025-01-09 22:23:41,696 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 52 [2025-01-09 22:23:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:41,696 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2025-01-09 22:23:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.409090909090909) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2025-01-09 22:23:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:23:41,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:41,696 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-01-09 22:23:41,702 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:23:41,901 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,SelfDestructingSolverStorable11 [2025-01-09 22:23:41,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:41,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1867704670, now seen corresponding path program 2 times [2025-01-09 22:23:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872534781] [2025-01-09 22:23:41,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:41,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:23:41,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 53 statements. [2025-01-09 22:23:41,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:41,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 22:23:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872534781] [2025-01-09 22:23:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872534781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895751328] [2025-01-09 22:23:41,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:41,965 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:23:41,967 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:23:42,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:23:42,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 53 statements. [2025-01-09 22:23:42,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:42,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:42,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:23:42,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:42,041 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:23:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 22:23:42,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 22:23:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895751328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:42,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:42,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-09 22:23:42,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268763252] [2025-01-09 22:23:42,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:42,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:23:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:42,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:23:42,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:23:42,346 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:42,409 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-01-09 22:23:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:23:42,410 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 22:23:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:42,410 INFO L225 Difference]: With dead ends: 84 [2025-01-09 22:23:42,410 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 22:23:42,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:23:42,411 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:42,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 22:23:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 22:23:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.1125) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-01-09 22:23:42,413 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 53 [2025-01-09 22:23:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:42,414 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-01-09 22:23:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2025-01-09 22:23:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:23:42,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:42,414 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:42,421 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:23:42,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:42,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:42,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 517464609, now seen corresponding path program 2 times [2025-01-09 22:23:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314240841] [2025-01-09 22:23:42,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:42,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:42,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-01-09 22:23:42,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 61 statements. [2025-01-09 22:23:42,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:23:42,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-01-09 22:23:42,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:42,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314240841] [2025-01-09 22:23:42,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314240841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:42,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:42,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508712504] [2025-01-09 22:23:42,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:42,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:42,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:42,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:42,663 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:42,689 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-01-09 22:23:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:42,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 22:23:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:42,690 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:23:42,690 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:23:42,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:42,691 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:42,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:23:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 22:23:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 80 states have (on average 1.1) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-01-09 22:23:42,698 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 61 [2025-01-09 22:23:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-01-09 22:23:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-01-09 22:23:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 22:23:42,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:42,698 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:42,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:23:42,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash 517464608, now seen corresponding path program 1 times [2025-01-09 22:23:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:42,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247139995] [2025-01-09 22:23:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:42,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:23:42,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:23:42,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:42,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:42,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247139995] [2025-01-09 22:23:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247139995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330456594] [2025-01-09 22:23:42,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:42,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:42,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:42,822 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:23:42,824 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:23:42,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 22:23:42,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 22:23:42,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:42,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:42,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:23:42,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:42,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:23:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330456594] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:43,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-01-09 22:23:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520910054] [2025-01-09 22:23:43,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:43,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:43,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:43,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:43,008 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:43,059 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2025-01-09 22:23:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:23:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 22:23:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:43,060 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:23:43,060 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:23:43,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:43,061 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:43,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:23:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 22:23:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2025-01-09 22:23:43,063 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 61 [2025-01-09 22:23:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:43,063 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2025-01-09 22:23:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2025-01-09 22:23:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 22:23:43,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:43,068 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-01-09 22:23:43,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:43,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:23:43,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1740181968, now seen corresponding path program 3 times [2025-01-09 22:23:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858614766] [2025-01-09 22:23:43,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:23:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:43,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-01-09 22:23:43,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 76 statements. [2025-01-09 22:23:43,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:23:43,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-01-09 22:23:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858614766] [2025-01-09 22:23:43,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858614766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:43,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:23:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834531621] [2025-01-09 22:23:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:23:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:43,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:23:43,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:23:43,395 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:43,488 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2025-01-09 22:23:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:23:43,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 22:23:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:43,489 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:23:43,489 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:23:43,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:43,489 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:43,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:23:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:23:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-01-09 22:23:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-01-09 22:23:43,491 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2025-01-09 22:23:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:43,491 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-01-09 22:23:43,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-01-09 22:23:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:23:43,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:43,496 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:23:43,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-09 22:23:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1888924912, now seen corresponding path program 2 times [2025-01-09 22:23:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402841201] [2025-01-09 22:23:43,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:23:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:43,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-09 22:23:43,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:23:43,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:23:43,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:23:43,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:23:43,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:23:43,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:23:43,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:43,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:23:43,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:23:43,606 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:23:43,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2025-01-09 22:23:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-01-09 22:23:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-01-09 22:23:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-01-09 22:23:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-01-09 22:23:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-01-09 22:23:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-01-09 22:23:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-01-09 22:23:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-01-09 22:23:43,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:23:43,613 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:43,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:23:43,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:23:43 BoogieIcfgContainer [2025-01-09 22:23:43,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:23:43,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:23:43,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:23:43,654 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:23:43,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:23:35" (3/4) ... [2025-01-09 22:23:43,657 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 22:23:43,699 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 27. [2025-01-09 22:23:43,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:23:43,748 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:23:43,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:23:43,749 INFO L158 Benchmark]: Toolchain (without parser) took 8904.59ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 107.0MB in the beginning and 152.5MB in the end (delta: -45.5MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2025-01-09 22:23:43,749 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:43,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.07ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 96.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:23:43,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.73ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:43,750 INFO L158 Benchmark]: Boogie Preprocessor took 21.26ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:23:43,752 INFO L158 Benchmark]: RCFGBuilder took 262.28ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 81.7MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:23:43,752 INFO L158 Benchmark]: TraceAbstraction took 8363.28ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.0MB in the beginning and 160.9MB in the end (delta: -79.9MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2025-01-09 22:23:43,752 INFO L158 Benchmark]: Witness Printer took 93.92ms. Allocated memory is still 302.0MB. Free memory was 160.9MB in the beginning and 152.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:23:43,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.07ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 96.2MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.73ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.26ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 262.28ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 81.7MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8363.28ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.0MB in the beginning and 160.9MB in the end (delta: -79.9MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Witness Printer took 93.92ms. Allocated memory is still 302.0MB. Free memory was 160.9MB in the beginning and 152.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; VAL [array={1:0}] [L25] CALL, EXPR getNumbers2() [L13] CALL, EXPR getNumbers() [L5] int i = 0; VAL [array={1:0}, i=0] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=1] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=2] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=3] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=4] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=5] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=6] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=7] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=8] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=9] [L5] COND TRUE i < 10 VAL [array={1:0}] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=10] [L5] COND FALSE !(i < 10) [L9] return array; VAL [\result={1:0}, array={1:0}] [L13] RET, EXPR getNumbers() [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={1:0}, i=0, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=1, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=2, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=3, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=4, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=5, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=6, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=7, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=8, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=9, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=10, numbers2={10:0}, numbers={1:0}] [L17] COND FALSE !(i < 10) [L21] return numbers2; [L21] return numbers2; VAL [\result={10:0}, array={1:0}, numbers={1:0}] [L25] RET, EXPR getNumbers2() [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 17, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 571 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 197 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 726 GetRequests, 573 SyntacticMatches, 4 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=12, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1210 ConstructedInterpolants, 66 QuantifiedInterpolants, 9607 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1342 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 3838/4253 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 22:23:43,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)