./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:48:18,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:48:18,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:48:18,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:48:18,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:48:18,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:48:18,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:48:18,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:48:18,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:48:18,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:48:18,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:48:18,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:48:18,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:48:18,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:48:18,682 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:48:18,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:48:18,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:48:18,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:48:18,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:48:18,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2025-02-08 06:48:18,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:48:18,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:48:18,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:48:18,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:48:18,954 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:48:18,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2025-02-08 06:48:20,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af1f16d13/10efe4ae396c4b818c2221ff10d49f44/FLAGef2a8af1e [2025-02-08 06:48:21,116 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:48:21,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2025-02-08 06:48:21,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af1f16d13/10efe4ae396c4b818c2221ff10d49f44/FLAGef2a8af1e [2025-02-08 06:48:21,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af1f16d13/10efe4ae396c4b818c2221ff10d49f44 [2025-02-08 06:48:21,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:48:21,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:48:21,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:48:21,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:48:21,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:48:21,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552adb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21, skipping insertion in model container [2025-02-08 06:48:21,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:48:21,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:48:21,290 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:48:21,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:48:21,318 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:48:21,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21 WrapperNode [2025-02-08 06:48:21,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:48:21,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:48:21,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:48:21,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:48:21,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,345 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-02-08 06:48:21,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:48:21,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:48:21,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:48:21,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:48:21,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,373 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2025-02-08 06:48:21,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:48:21,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:48:21,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:48:21,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:48:21,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (1/1) ... [2025-02-08 06:48:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:48:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:48:21,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:48:21,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:48:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:48:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2025-02-08 06:48:21,437 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2025-02-08 06:48:21,437 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:48:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:48:21,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:48:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:48:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:48:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:48:21,498 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:48:21,499 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:48:21,635 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-08 06:48:21,635 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:48:21,644 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:48:21,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:48:21,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:48:21 BoogieIcfgContainer [2025-02-08 06:48:21,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:48:21,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:48:21,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:48:21,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:48:21,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:48:21" (1/3) ... [2025-02-08 06:48:21,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a9394b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:48:21, skipping insertion in model container [2025-02-08 06:48:21,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:48:21" (2/3) ... [2025-02-08 06:48:21,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a9394b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:48:21, skipping insertion in model container [2025-02-08 06:48:21,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:48:21" (3/3) ... [2025-02-08 06:48:21,658 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2025-02-08 06:48:21,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:48:21,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-recursive.c that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-08 06:48:21,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:48:21,715 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;@1fc5449c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:48:21,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 06:48:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:48:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:48:21,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:21,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:48:21,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1663, now seen corresponding path program 1 times [2025-02-08 06:48:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639793004] [2025-02-08 06:48:21,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:21,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:48:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:48:21,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:21,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639793004] [2025-02-08 06:48:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639793004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:48:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196063208] [2025-02-08 06:48:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:21,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:48:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:21,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:48:21,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:48:21,989 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 06:48:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:22,044 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-02-08 06:48:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:48:22,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 06:48:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:22,051 INFO L225 Difference]: With dead ends: 35 [2025-02-08 06:48:22,051 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 06:48:22,055 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-02-08 06:48:22,057 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 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-02-08 06:48:22,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:48:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 06:48:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 06:48:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 28 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:48:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-02-08 06:48:22,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 2 [2025-02-08 06:48:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:22,093 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-02-08 06:48:22,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 06:48:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-02-08 06:48:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:48:22,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:22,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:48:22,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:48:22,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 1 times [2025-02-08 06:48:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350075206] [2025-02-08 06:48:22,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:22,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:48:22,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:48:22,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:22,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:22,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350075206] [2025-02-08 06:48:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350075206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:48:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044981706] [2025-02-08 06:48:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:48:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:22,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:48:22,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:48:22,255 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 06:48:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:22,283 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2025-02-08 06:48:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:48:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 06:48:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:22,285 INFO L225 Difference]: With dead ends: 32 [2025-02-08 06:48:22,285 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 06:48:22,285 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-02-08 06:48:22,286 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:22,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:48:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 06:48:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 06:48:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.588235294117647) internal successors, (27), 27 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:48:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-02-08 06:48:22,293 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 2 [2025-02-08 06:48:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:22,293 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-02-08 06:48:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 06:48:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-02-08 06:48:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:48:22,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:22,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:48:22,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:48:22,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 49548613, now seen corresponding path program 1 times [2025-02-08 06:48:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188830357] [2025-02-08 06:48:22,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:22,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:48:22,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:48:22,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:22,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:22,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188830357] [2025-02-08 06:48:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188830357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:22,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:22,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:48:22,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967383500] [2025-02-08 06:48:22,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:22,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:48:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:22,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:48:22,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:48:22,406 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:22,523 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-02-08 06:48:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:48:22,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:48:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:22,526 INFO L225 Difference]: With dead ends: 47 [2025-02-08 06:48:22,526 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 06:48:22,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:48:22,527 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:22,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:48:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 06:48:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2025-02-08 06:48:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.565217391304348) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:48:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-08 06:48:22,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 5 [2025-02-08 06:48:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-08 06:48:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-08 06:48:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:48:22,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:22,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:48:22,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:48:22,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:22,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash 49548614, now seen corresponding path program 1 times [2025-02-08 06:48:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:22,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002485377] [2025-02-08 06:48:22,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:22,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:48:22,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:48:22,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:22,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002485377] [2025-02-08 06:48:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002485377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:22,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:48:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844963404] [2025-02-08 06:48:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:22,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:48:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:48:22,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:48:22,698 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:22,777 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-02-08 06:48:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:48:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:48:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:22,779 INFO L225 Difference]: With dead ends: 43 [2025-02-08 06:48:22,779 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 06:48:22,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:48:22,780 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:22,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 78 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:48:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 06:48:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-02-08 06:48:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 33 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:48:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-08 06:48:22,784 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 5 [2025-02-08 06:48:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-08 06:48:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-08 06:48:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:48:22,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:22,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:48:22,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:22,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash 602195749, now seen corresponding path program 1 times [2025-02-08 06:48:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662169310] [2025-02-08 06:48:22,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:48:22,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:48:22,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:22,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662169310] [2025-02-08 06:48:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662169310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:48:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917479523] [2025-02-08 06:48:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:48:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:23,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:48:23,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:48:23,016 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:23,130 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-02-08 06:48:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:48:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:48:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:23,131 INFO L225 Difference]: With dead ends: 39 [2025-02-08 06:48:23,132 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 06:48:23,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:48:23,133 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:23,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:48:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 06:48:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-02-08 06:48:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:48:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-02-08 06:48:23,140 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 9 [2025-02-08 06:48:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:23,140 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-02-08 06:48:23,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-02-08 06:48:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:48:23,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:23,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:48:23,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash 602195748, now seen corresponding path program 1 times [2025-02-08 06:48:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332594653] [2025-02-08 06:48:23,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:23,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:48:23,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:48:23,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:23,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332594653] [2025-02-08 06:48:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332594653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:23,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:23,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:48:23,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518236671] [2025-02-08 06:48:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:23,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:48:23,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:23,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:48:23,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:48:23,244 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:23,339 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-02-08 06:48:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:48:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:48:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:23,341 INFO L225 Difference]: With dead ends: 36 [2025-02-08 06:48:23,342 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 06:48:23,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:48:23,342 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:23,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 49 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:48:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 06:48:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-02-08 06:48:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:48:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-02-08 06:48:23,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 9 [2025-02-08 06:48:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:23,352 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-02-08 06:48:23,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-02-08 06:48:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:48:23,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:23,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:23,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:48:23,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash 602405312, now seen corresponding path program 1 times [2025-02-08 06:48:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569936887] [2025-02-08 06:48:23,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:23,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:48:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:48:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569936887] [2025-02-08 06:48:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569936887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:23,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:48:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167994239] [2025-02-08 06:48:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:48:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:23,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:48:23,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:48:23,477 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:23,526 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-02-08 06:48:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:48:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:48:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:23,527 INFO L225 Difference]: With dead ends: 30 [2025-02-08 06:48:23,527 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 06:48:23,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:48:23,528 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:23,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:48:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 06:48:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 06:48:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:48:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-02-08 06:48:23,535 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 9 [2025-02-08 06:48:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:23,536 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-02-08 06:48:23,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-02-08 06:48:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:48:23,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:23,537 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:23,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:48:23,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:23,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1087238073, now seen corresponding path program 1 times [2025-02-08 06:48:23,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148044648] [2025-02-08 06:48:23,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:23,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:48:23,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:48:23,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:23,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148044648] [2025-02-08 06:48:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148044648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:48:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296751469] [2025-02-08 06:48:23,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:23,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:48:23,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:48:23,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:48:23,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:48:24,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:48:24,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:24,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:24,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 06:48:24,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:48:24,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:48:24,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 06:48:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:24,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:48:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:24,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296751469] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:48:24,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:48:24,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2025-02-08 06:48:24,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291263044] [2025-02-08 06:48:24,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:48:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:48:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:24,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:48:24,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:48:24,556 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 29 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 23 states have internal predecessors, (35), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:25,049 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-02-08 06:48:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:48:25,050 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 23 states have internal predecessors, (35), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 06:48:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:25,051 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:48:25,051 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:48:25,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=1654, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:48:25,053 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:25,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 206 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:48:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:48:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-02-08 06:48:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 43 states have internal predecessors, (44), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-08 06:48:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-02-08 06:48:25,065 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 19 [2025-02-08 06:48:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:25,065 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-02-08 06:48:25,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 23 states have internal predecessors, (35), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-02-08 06:48:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:48:25,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:25,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:25,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:48:25,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:25,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1308587797, now seen corresponding path program 2 times [2025-02-08 06:48:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083394014] [2025-02-08 06:48:25,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:48:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:25,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 06:48:25,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:48:25,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:48:25,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083394014] [2025-02-08 06:48:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083394014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:48:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345186175] [2025-02-08 06:48:26,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:48:26,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:26,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:48:26,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:48:26,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:48:26,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 06:48:26,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:48:26,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:48:26,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:26,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-08 06:48:26,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:48:26,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:48:26,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 06:48:26,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 06:48:26,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 06:48:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:26,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:48:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345186175] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:48:27,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:48:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 27] total 57 [2025-02-08 06:48:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358041320] [2025-02-08 06:48:27,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:48:27,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-08 06:48:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:27,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-08 06:48:27,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2863, Unknown=0, NotChecked=0, Total=3192 [2025-02-08 06:48:27,374 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 57 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 43 states have internal predecessors, (73), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:28,526 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-02-08 06:48:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-08 06:48:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 43 states have internal predecessors, (73), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-08 06:48:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:28,528 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:48:28,529 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:48:28,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=934, Invalid=7438, Unknown=0, NotChecked=0, Total=8372 [2025-02-08 06:48:28,533 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 103 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:28,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 365 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:48:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:48:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-02-08 06:48:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 75 states have internal predecessors, (76), 15 states have call successors, (15), 15 states have call predecessors, (15), 5 states have return successors, (17), 5 states have call predecessors, (17), 15 states have call successors, (17) [2025-02-08 06:48:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-02-08 06:48:28,546 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 39 [2025-02-08 06:48:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-02-08 06:48:28,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 43 states have internal predecessors, (73), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-02-08 06:48:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 06:48:28,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:28,548 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:28,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:48:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:28,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2130351183, now seen corresponding path program 3 times [2025-02-08 06:48:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988345303] [2025-02-08 06:48:28,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:48:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:28,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 8 equivalence classes. [2025-02-08 06:48:28,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 79 statements. [2025-02-08 06:48:28,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:48:28,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-08 06:48:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988345303] [2025-02-08 06:48:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988345303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:48:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811614746] [2025-02-08 06:48:29,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:48:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:48:29,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:48:29,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:48:29,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 8 equivalence classes. [2025-02-08 06:48:29,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 79 statements. [2025-02-08 06:48:29,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 06:48:29,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:29,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:48:29,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:48:29,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 06:48:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-08 06:48:29,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:48:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 68 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-08 06:48:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811614746] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:48:29,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:48:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2025-02-08 06:48:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895587807] [2025-02-08 06:48:29,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:48:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:48:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:29,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:48:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:48:29,338 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:29,537 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-02-08 06:48:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:48:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-08 06:48:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:29,538 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:48:29,538 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:48:29,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 144 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-02-08 06:48:29,539 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:29,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:48:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:48:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2025-02-08 06:48:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 13 states have call successors, (13), 13 states have call predecessors, (13), 5 states have return successors, (15), 5 states have call predecessors, (15), 13 states have call successors, (15) [2025-02-08 06:48:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-02-08 06:48:29,549 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 79 [2025-02-08 06:48:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:29,549 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-02-08 06:48:29,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:48:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-02-08 06:48:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 06:48:29,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:29,551 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:29,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:48:29,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:29,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:29,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1666400586, now seen corresponding path program 1 times [2025-02-08 06:48:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483943595] [2025-02-08 06:48:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:29,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 06:48:29,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:48:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 06:48:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483943595] [2025-02-08 06:48:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483943595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:48:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111313097] [2025-02-08 06:48:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:48:31,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:48:31,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:48:31,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:48:31,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:48:31,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 06:48:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:48:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:48:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:31,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-02-08 06:48:31,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:48:31,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:48:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-08 06:48:32,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:48:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:48:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111313097] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:48:42,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:48:42,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 61] total 92 [2025-02-08 06:48:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091933266] [2025-02-08 06:48:42,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:48:42,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-02-08 06:48:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:42,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-02-08 06:48:42,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=7351, Unknown=0, NotChecked=0, Total=8372 [2025-02-08 06:48:42,872 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 92 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 78 states have internal predecessors, (109), 19 states have call successors, (19), 14 states have call predecessors, (19), 28 states have return successors, (39), 27 states have call predecessors, (39), 19 states have call successors, (39) [2025-02-08 06:48:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:43,590 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2025-02-08 06:48:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:48:43,590 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 78 states have internal predecessors, (109), 19 states have call successors, (19), 14 states have call predecessors, (19), 28 states have return successors, (39), 27 states have call predecessors, (39), 19 states have call successors, (39) Word has length 96 [2025-02-08 06:48:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:43,592 INFO L225 Difference]: With dead ends: 111 [2025-02-08 06:48:43,592 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 06:48:43,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 151 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5090 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1280, Invalid=8620, Unknown=0, NotChecked=0, Total=9900 [2025-02-08 06:48:43,595 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:48:43,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 363 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:48:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 06:48:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-02-08 06:48:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 17 states have return successors, (47), 17 states have call predecessors, (47), 13 states have call successors, (47) [2025-02-08 06:48:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2025-02-08 06:48:43,613 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 96 [2025-02-08 06:48:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:43,613 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2025-02-08 06:48:43,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 78 states have internal predecessors, (109), 19 states have call successors, (19), 14 states have call predecessors, (19), 28 states have return successors, (39), 27 states have call predecessors, (39), 19 states have call successors, (39) [2025-02-08 06:48:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2025-02-08 06:48:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-08 06:48:43,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:48:43,617 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:43,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:48:43,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:48:43,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONMEMORY_LEAK, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-02-08 06:48:43,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:48:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1571482336, now seen corresponding path program 2 times [2025-02-08 06:48:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:48:43,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458963562] [2025-02-08 06:48:43,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:48:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:48:43,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-02-08 06:48:43,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 124 statements. [2025-02-08 06:48:43,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:48:43,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:48:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-02-08 06:48:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:48:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458963562] [2025-02-08 06:48:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458963562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:48:43,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:48:43,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:48:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614965118] [2025-02-08 06:48:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:48:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:48:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:48:43,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:48:43,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:48:43,884 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:48:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:48:43,901 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2025-02-08 06:48:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:48:43,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 124 [2025-02-08 06:48:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:48:43,903 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:48:43,903 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:48:43,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:48:43,903 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 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-02-08 06:48:43,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:48:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:48:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:48:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-08 06:48:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:48:43,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2025-02-08 06:48:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:48:43,904 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:48:43,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:48:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:48:43,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:48:43,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2025-02-08 06:48:43,910 INFO L782 garLoopResultBuilder]: Registering result SAFE for location plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2025-02-08 06:48:43,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:48:43,915 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:48:43,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:48:43,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:48:43 BoogieIcfgContainer [2025-02-08 06:48:43,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:48:43,922 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:48:43,922 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:48:43,923 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:48:43,923 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:48:21" (3/4) ... [2025-02-08 06:48:43,925 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:48:43,930 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure foo [2025-02-08 06:48:43,931 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure plus [2025-02-08 06:48:43,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 06:48:43,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 06:48:43,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:48:43,934 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:48:43,935 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:48:44,003 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:48:44,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:48:44,004 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:48:44,005 INFO L158 Benchmark]: Toolchain (without parser) took 22866.15ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 132.8MB in the beginning and 296.9MB in the end (delta: -164.1MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2025-02-08 06:48:44,005 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:48:44,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.20ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 122.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:48:44,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.13ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:48:44,007 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 987.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:48:44,007 INFO L158 Benchmark]: IcfgBuilder took 265.54ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 107.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:48:44,007 INFO L158 Benchmark]: TraceAbstraction took 22272.87ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 106.8MB in the beginning and 300.9MB in the end (delta: -194.1MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2025-02-08 06:48:44,008 INFO L158 Benchmark]: Witness Printer took 81.57ms. Allocated memory is still 444.6MB. Free memory was 300.9MB in the beginning and 296.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:48:44,008 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.20ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 122.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.13ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 121.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 987.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.54ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 107.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22272.87ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 106.8MB in the beginning and 300.9MB in the end (delta: -194.1MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * Witness Printer took 81.57ms. Allocated memory is still 444.6MB. Free memory was 300.9MB in the beginning and 296.9MB in the end (delta: 4.1MB). There was no memory consumed. 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 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1295 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1939 IncrementalHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 257 mSDtfsCounter, 1939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 370 SyntacticMatches, 19 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7960 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=11, InterpolantAutomatonStates: 160, 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, 12 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 631 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 5894 SizeOfPredicates, 67 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 328 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 1458/1971 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:48:44,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE