./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:59:20,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:59:20,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:59:20,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:59:20,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:59:20,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:59:20,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:59:20,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:59:20,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:59:20,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:59:20,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:59:20,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:59:20,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:59:20,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:59:20,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:59:20,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:59:20,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:59:20,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:59:20,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd [2025-03-17 11:59:20,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:59:20,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:59:20,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:59:20,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:59:20,562 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:59:20,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2025-03-17 11:59:21,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf01dd76/a414985ebd2a42d09f434d6a0f7795d1/FLAGbbddea0bf [2025-03-17 11:59:21,933 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:59:21,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2025-03-17 11:59:21,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf01dd76/a414985ebd2a42d09f434d6a0f7795d1/FLAGbbddea0bf [2025-03-17 11:59:22,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf01dd76/a414985ebd2a42d09f434d6a0f7795d1 [2025-03-17 11:59:22,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:59:22,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:59:22,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:59:22,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:59:22,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:59:22,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379cc360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22, skipping insertion in model container [2025-03-17 11:59:22,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:59:22,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:59:22,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:59:22,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:59:22,395 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:59:22,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22 WrapperNode [2025-03-17 11:59:22,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:59:22,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:59:22,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:59:22,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:59:22,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,424 INFO L138 Inliner]: procedures = 11, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2025-03-17 11:59:22,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:59:22,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:59:22,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:59:22,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:59:22,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,443 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-03-17 11:59:22,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:59:22,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:59:22,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:59:22,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:59:22,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (1/1) ... [2025-03-17 11:59:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:59:22,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:22,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:59:22,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:59:22,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:59:22,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:59:22,555 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:59:22,556 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:59:22,673 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset);havoc getNumbers2_~#numbers2~0#1.base, getNumbers2_~#numbers2~0#1.offset; [2025-03-17 11:59:22,678 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-17 11:59:22,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:59:22,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:59:22,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:59:22,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:59:22 BoogieIcfgContainer [2025-03-17 11:59:22,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:59:22,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:59:22,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:59:22,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:59:22,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:59:22" (1/3) ... [2025-03-17 11:59:22,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2e3ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:59:22, skipping insertion in model container [2025-03-17 11:59:22,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:22" (2/3) ... [2025-03-17 11:59:22,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2e3ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:59:22, skipping insertion in model container [2025-03-17 11:59:22,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:59:22" (3/3) ... [2025-03-17 11:59:22,691 INFO L128 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2025-03-17 11:59:22,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:59:22,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG getNumbers2.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-17 11:59:22,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:59:22,733 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;@2376c7e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:59:22,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:59:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:59:22,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:22,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:59:22,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:22,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 53589, now seen corresponding path program 1 times [2025-03-17 11:59:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:22,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269856621] [2025-03-17 11:59:22,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:22,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:22,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:59:22,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:59:22,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:22,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269856621] [2025-03-17 11:59:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269856621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:59:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092023527] [2025-03-17 11:59:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:22,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:22,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:22,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:22,920 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:22,952 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-03-17 11:59:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:59:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:22,958 INFO L225 Difference]: With dead ends: 22 [2025-03-17 11:59:22,958 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 11:59:22,959 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-03-17 11:59:22,961 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:22,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 11:59:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 11:59:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.75) internal successors, (21), 19 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-03-17 11:59:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-03-17 11:59:22,980 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 3 [2025-03-17 11:59:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:22,981 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-17 11:59:22,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-03-17 11:59:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:59:22,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:22,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:59:22,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:59:22,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash 53590, now seen corresponding path program 1 times [2025-03-17 11:59:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662680635] [2025-03-17 11:59:22,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:22,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:59:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:59:22,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:22,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662680635] [2025-03-17 11:59:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662680635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:59:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313726357] [2025-03-17 11:59:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:23,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:23,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:23,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:23,066 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:23,092 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-17 11:59:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 11:59:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:23,093 INFO L225 Difference]: With dead ends: 23 [2025-03-17 11:59:23,093 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 11:59:23,094 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-03-17 11:59:23,094 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:23,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 11:59:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-17 11:59:23,097 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-03-17 11:59:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-17 11:59:23,097 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 3 [2025-03-17 11:59:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:23,097 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-17 11:59:23,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-17 11:59:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:59:23,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:23,098 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 11:59:23,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:59:23,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:23,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1596459102, now seen corresponding path program 1 times [2025-03-17 11:59:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803962546] [2025-03-17 11:59:23,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:23,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:59:23,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:59:23,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803962546] [2025-03-17 11:59:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803962546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339433675] [2025-03-17 11:59:23,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:23,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:23,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:23,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:23,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:59:23,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:59:23,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:59:23,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:23,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:23,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:59:23,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339433675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:23,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:23,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-17 11:59:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806252484] [2025-03-17 11:59:23,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:23,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:59:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:23,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:59:23,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:23,429 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:23,539 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-17 11:59:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:59:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 6 [2025-03-17 11:59:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:23,541 INFO L225 Difference]: With dead ends: 29 [2025-03-17 11:59:23,541 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 11:59:23,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:23,542 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:23,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 61 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:59:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 11:59:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-03-17 11:59:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-17 11:59:23,547 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2025-03-17 11:59:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:23,547 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-17 11:59:23,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-17 11:59:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:59:23,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:23,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-17 11:59:23,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:23,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:23,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash 16605978, now seen corresponding path program 1 times [2025-03-17 11:59:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827457571] [2025-03-17 11:59:23,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:23,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:59:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:59:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827457571] [2025-03-17 11:59:23,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827457571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151711371] [2025-03-17 11:59:23,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:23,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:23,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:23,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:23,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:59:23,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:59:23,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:59:23,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:23,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:23,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:59:23,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151711371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:23,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 11:59:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559400183] [2025-03-17 11:59:23,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:23,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:59:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:23,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:59:23,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:23,939 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:23,972 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-03-17 11:59:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:59:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 11:59:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:23,974 INFO L225 Difference]: With dead ends: 35 [2025-03-17 11:59:23,974 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 11:59:23,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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-03-17 11:59:23,974 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:23,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 11:59:23,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-17 11:59:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 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-03-17 11:59:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-17 11:59:23,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 10 [2025-03-17 11:59:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:23,980 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-17 11:59:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-17 11:59:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:59:23,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:23,980 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1] [2025-03-17 11:59:23,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:24,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 11:59:24,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:24,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2117623066, now seen corresponding path program 2 times [2025-03-17 11:59:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087389215] [2025-03-17 11:59:24,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:24,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 11:59:24,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 22 statements. [2025-03-17 11:59:24,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:24,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 11:59:24,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:24,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087389215] [2025-03-17 11:59:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087389215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889250474] [2025-03-17 11:59:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:59:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:24,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:59:24,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:59:24,276 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:24,312 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2025-03-17 11:59:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:59:24,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:59:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:24,313 INFO L225 Difference]: With dead ends: 40 [2025-03-17 11:59:24,313 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 11:59:24,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:59:24,314 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:24,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 11:59:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-03-17 11:59:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 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-03-17 11:59:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-03-17 11:59:24,316 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2025-03-17 11:59:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:24,316 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-03-17 11:59:24,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-03-17 11:59:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:59:24,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:24,316 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1] [2025-03-17 11:59:24,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:59:24,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:24,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2117623065, now seen corresponding path program 1 times [2025-03-17 11:59:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560734467] [2025-03-17 11:59:24,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:24,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:59:24,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:59:24,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:24,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560734467] [2025-03-17 11:59:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560734467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445659766] [2025-03-17 11:59:24,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:24,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:24,422 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:24,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:59:24,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:59:24,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:59:24,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:24,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:24,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:59:24,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:24,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445659766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:24,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:24,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-17 11:59:24,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652925705] [2025-03-17 11:59:24,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:24,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:59:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:24,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:59:24,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:24,579 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:24,618 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-03-17 11:59:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:59:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 11:59:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:24,620 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:59:24,620 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:59:24,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 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-03-17 11:59:24,621 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:24,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:59:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 11:59:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-03-17 11:59:24,625 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 22 [2025-03-17 11:59:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:24,626 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-03-17 11:59:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-03-17 11:59:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 11:59:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:24,626 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1] [2025-03-17 11:59:24,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:59:24,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:24,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:24,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -389261543, now seen corresponding path program 2 times [2025-03-17 11:59:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770458537] [2025-03-17 11:59:24,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:24,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 11:59:24,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 34 statements. [2025-03-17 11:59:24,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:24,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770458537] [2025-03-17 11:59:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770458537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076206706] [2025-03-17 11:59:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:59:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:24,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:59:24,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:59:24,877 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:24,903 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-03-17 11:59:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:59:24,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 11:59:24,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:24,904 INFO L225 Difference]: With dead ends: 48 [2025-03-17 11:59:24,904 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:59:24,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:59:24,905 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:24,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:59:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 11:59:24,910 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-03-17 11:59:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2025-03-17 11:59:24,910 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 34 [2025-03-17 11:59:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:24,911 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2025-03-17 11:59:24,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2025-03-17 11:59:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:59:24,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:24,913 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 11:59:24,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:59:24,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:24,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 817794036, now seen corresponding path program 1 times [2025-03-17 11:59:24,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:24,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850089717] [2025-03-17 11:59:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:24,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:59:24,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:59:24,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:24,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850089717] [2025-03-17 11:59:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850089717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:24,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:24,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640792348] [2025-03-17 11:59:24,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:24,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:24,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:24,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:24,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:24,961 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:24,975 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2025-03-17 11:59:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:24,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 35 [2025-03-17 11:59:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:24,976 INFO L225 Difference]: With dead ends: 47 [2025-03-17 11:59:24,976 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:59:24,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:24,977 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:24,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:59:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 11:59:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2025-03-17 11:59:24,979 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 35 [2025-03-17 11:59:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:24,979 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2025-03-17 11:59:24,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2025-03-17 11:59:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:59:24,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:24,980 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 11:59:24,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:59:24,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:24,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash 817794037, now seen corresponding path program 1 times [2025-03-17 11:59:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867485305] [2025-03-17 11:59:24,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:24,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:59:24,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:59:24,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:24,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867485305] [2025-03-17 11:59:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867485305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:25,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:25,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604565902] [2025-03-17 11:59:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:25,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:25,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:25,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:25,123 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:25,138 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-03-17 11:59:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:25,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 35 [2025-03-17 11:59:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:25,139 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:59:25,139 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:59:25,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:25,140 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:25,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:59:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-17 11:59:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) 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-03-17 11:59:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2025-03-17 11:59:25,142 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 35 [2025-03-17 11:59:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:25,142 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2025-03-17 11:59:25,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2025-03-17 11:59:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:59:25,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:25,143 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:25,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:59:25,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1847603926, now seen corresponding path program 1 times [2025-03-17 11:59:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269673291] [2025-03-17 11:59:25,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:59:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:59:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:25,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:25,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269673291] [2025-03-17 11:59:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269673291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987632260] [2025-03-17 11:59:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:25,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:25,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:25,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:59:25,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:59:25,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:59:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:25,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:25,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 11:59:25,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:25,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:25,664 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-03-17 11:59:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:25,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987632260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:26,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 11:59:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137054475] [2025-03-17 11:59:26,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:26,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:59:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:26,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:59:26,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:59:26,116 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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-03-17 11:59:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:26,222 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-03-17 11:59:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:59:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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 38 [2025-03-17 11:59:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:26,223 INFO L225 Difference]: With dead ends: 59 [2025-03-17 11:59:26,223 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 11:59:26,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:59:26,224 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 101 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:26,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 22 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:59:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 11:59:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 11:59:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-17 11:59:26,227 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 38 [2025-03-17 11:59:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:26,227 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-17 11:59:26,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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-03-17 11:59:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-17 11:59:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:59:26,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:26,228 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 11:59:26,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:26,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:26,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:26,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1441146809, now seen corresponding path program 1 times [2025-03-17 11:59:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550977367] [2025-03-17 11:59:26,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:26,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:59:26,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:59:26,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:26,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550977367] [2025-03-17 11:59:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550977367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935366935] [2025-03-17 11:59:26,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:26,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:26,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:26,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:26,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:59:26,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:59:26,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:59:26,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:26,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:26,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:59:26,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:26,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:59:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:26,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935366935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:26,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:26,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-17 11:59:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307437870] [2025-03-17 11:59:26,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:59:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:26,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:59:26,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:59:26,690 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:26,738 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2025-03-17 11:59:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:59:26,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 11:59:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:26,739 INFO L225 Difference]: With dead ends: 60 [2025-03-17 11:59:26,739 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 11:59:26,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:26,739 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:26,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 11:59:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 11:59:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2025-03-17 11:59:26,742 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 39 [2025-03-17 11:59:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:26,742 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2025-03-17 11:59:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2025-03-17 11:59:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 11:59:26,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:26,742 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 11:59:26,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:59:26,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:59:26,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 580002420, now seen corresponding path program 1 times [2025-03-17 11:59:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120218621] [2025-03-17 11:59:26,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:59:26,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:59:26,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:26,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:27,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120218621] [2025-03-17 11:59:27,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120218621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339820169] [2025-03-17 11:59:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:27,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:27,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:59:27,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:59:27,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:59:27,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:27,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:27,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:59:27,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:27,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339820169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:27,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 11:59:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760562759] [2025-03-17 11:59:27,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:59:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:59:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:27,117 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:27,157 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-17 11:59:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:59:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 11:59:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:27,158 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:59:27,158 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:59:27,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 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-03-17 11:59:27,159 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:27,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:59:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 11:59:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-17 11:59:27,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 43 [2025-03-17 11:59:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:27,161 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-17 11:59:27,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-17 11:59:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 11:59:27,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:27,162 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 1, 1, 1] [2025-03-17 11:59:27,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:27,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2039370250, now seen corresponding path program 2 times [2025-03-17 11:59:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863277801] [2025-03-17 11:59:27,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:27,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 11:59:27,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:59:27,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:59:27,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:27,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863277801] [2025-03-17 11:59:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863277801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:27,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44674770] [2025-03-17 11:59:27,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:27,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:27,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:27,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:59:27,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 11:59:27,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:59:27,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:59:27,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:27,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:59:27,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:27,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:27,903 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-03-17 11:59:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:28,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44674770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:28,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-03-17 11:59:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532168661] [2025-03-17 11:59:28,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:59:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:28,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:59:28,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:59:28,439 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:28,760 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-03-17 11:59:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:59:28,760 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 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 50 [2025-03-17 11:59:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:28,761 INFO L225 Difference]: With dead ends: 81 [2025-03-17 11:59:28,761 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 11:59:28,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:59:28,761 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 136 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:28,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 52 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:59:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 11:59:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2025-03-17 11:59:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2025-03-17 11:59:28,764 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 50 [2025-03-17 11:59:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:28,764 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2025-03-17 11:59:28,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2025-03-17 11:59:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:59:28,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:28,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 1, 1, 1] [2025-03-17 11:59:28,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:28,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1204031739, now seen corresponding path program 2 times [2025-03-17 11:59:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:28,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230579503] [2025-03-17 11:59:28,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:28,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 11:59:28,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 51 statements. [2025-03-17 11:59:28,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-17 11:59:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230579503] [2025-03-17 11:59:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230579503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067902933] [2025-03-17 11:59:29,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:29,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:29,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:29,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:59:29,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 11:59:29,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 51 statements. [2025-03-17 11:59:29,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:29,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:29,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:59:29,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:29,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:59:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-17 11:59:29,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-17 11:59:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067902933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:29,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 11:59:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801648721] [2025-03-17 11:59:29,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:59:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:59:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:29,449 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-03-17 11:59:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:29,506 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2025-03-17 11:59:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:59:29,506 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 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 51 [2025-03-17 11:59:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:29,507 INFO L225 Difference]: With dead ends: 64 [2025-03-17 11:59:29,507 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 11:59:29,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:59:29,507 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:29,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 11:59:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 11:59:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 63 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-03-17 11:59:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2025-03-17 11:59:29,513 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 51 [2025-03-17 11:59:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:29,513 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2025-03-17 11:59:29,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2025-03-17 11:59:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 11:59:29,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:29,513 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-17 11:59:29,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 11:59:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 11:59:29,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1740409468, now seen corresponding path program 2 times [2025-03-17 11:59:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968869885] [2025-03-17 11:59:29,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:29,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-17 11:59:29,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:59:29,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:59:29,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968869885] [2025-03-17 11:59:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968869885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859316619] [2025-03-17 11:59:29,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:29,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:29,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:29,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:59:29,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-17 11:59:29,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:59:29,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:59:29,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:29,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:59:29,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:29,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:30,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-03-17 11:59:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859316619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:30,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-17 11:59:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025695007] [2025-03-17 11:59:30,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:30,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:59:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:30,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:59:30,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:30,008 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:30,043 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2025-03-17 11:59:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:59:30,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 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) Word has length 59 [2025-03-17 11:59:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:30,044 INFO L225 Difference]: With dead ends: 80 [2025-03-17 11:59:30,044 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 11:59:30,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 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-03-17 11:59:30,045 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:30,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 11:59:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 11:59:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.051948051948052) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2025-03-17 11:59:30,047 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 59 [2025-03-17 11:59:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:30,047 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2025-03-17 11:59:30,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2025-03-17 11:59:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 11:59:30,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:30,047 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 11:59:30,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:30,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:59:30,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-17 11:59:30,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1450399596, now seen corresponding path program 3 times [2025-03-17 11:59:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:30,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469099742] [2025-03-17 11:59:30,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:59:30,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:30,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 11 equivalence classes. [2025-03-17 11:59:30,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 11:59:30,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 11:59:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:59:30,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:59:30,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 11:59:30,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 11:59:30,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:30,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:59:30,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:59:30,359 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:59:30,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-03-17 11:59:30,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2025-03-17 11:59:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:59:30,364 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 11:59:30,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:59:30,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:59:30 BoogieIcfgContainer [2025-03-17 11:59:30,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:59:30,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:59:30,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:59:30,402 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:59:30,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:59:22" (3/4) ... [2025-03-17 11:59:30,403 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:59:30,440 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 27. [2025-03-17 11:59:30,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:59:30,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:59:30,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:59:30,485 INFO L158 Benchmark]: Toolchain (without parser) took 8229.95ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 154.9MB in the beginning and 112.0MB in the end (delta: 42.9MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2025-03-17 11:59:30,485 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:30,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.23ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 143.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:59:30,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.21ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 143.0MB in the end (delta: 918.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:30,486 INFO L158 Benchmark]: Boogie Preprocessor took 31.58ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 141.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:30,486 INFO L158 Benchmark]: IcfgBuilder took 227.41ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 128.1MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:59:30,486 INFO L158 Benchmark]: TraceAbstraction took 7714.62ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 127.7MB in the beginning and 120.4MB in the end (delta: 7.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-03-17 11:59:30,486 INFO L158 Benchmark]: Witness Printer took 83.28ms. Allocated memory is still 243.3MB. Free memory was 120.4MB in the beginning and 112.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:59:30,487 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 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.23ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 143.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.21ms. Allocated memory is still 201.3MB. Free memory was 143.9MB in the beginning and 143.0MB in the end (delta: 918.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.58ms. Allocated memory is still 201.3MB. Free memory was 143.0MB in the beginning and 141.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 227.41ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 128.1MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7714.62ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 127.7MB in the beginning and 120.4MB in the end (delta: 7.2MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * Witness Printer took 83.28ms. Allocated memory is still 243.3MB. Free memory was 120.4MB in the beginning and 112.0MB 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]; [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; [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: 24]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 24 edges, 9 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 16, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 731 IncrementalHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 192 mSDtfsCounter, 731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 572 SyntacticMatches, 8 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=15, InterpolantAutomatonStates: 100, 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, 15 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 843 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1053 ConstructedInterpolants, 62 QuantifiedInterpolants, 8085 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1447 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 3196/3705 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-03-17 11:59:30,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)