./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:47:01,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:47:01,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:47:01,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:47:01,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:47:01,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:47:01,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:47:01,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:47:01,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:47:01,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:47:01,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:47:01,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:47:01,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:47:01,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:47:01,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:47:01,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:47:01,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:47:01,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:47:01,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:47:01,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:47:01,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:47:01,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:47:01,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:47:01,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:47:01,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:47:01,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:47:01,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:47:01,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:47:01,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:47:01,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:47:01,821 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2025-01-09 22:47:02,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:47:02,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:47:02,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:47:02,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:47:02,087 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:47:02,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2025-01-09 22:47:03,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed0e2f57/aa7ae05db37d42528da10edeaa689971/FLAG1f57b4961 [2025-01-09 22:47:03,613 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:47:03,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2025-01-09 22:47:03,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed0e2f57/aa7ae05db37d42528da10edeaa689971/FLAG1f57b4961 [2025-01-09 22:47:03,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed0e2f57/aa7ae05db37d42528da10edeaa689971 [2025-01-09 22:47:03,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:47:03,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:47:03,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:47:03,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:47:03,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:47:03,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2830efc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03, skipping insertion in model container [2025-01-09 22:47:03,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:47:03,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:47:03,857 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:47:03,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:47:03,903 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:47:03,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03 WrapperNode [2025-01-09 22:47:03,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:47:03,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:47:03,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:47:03,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:47:03,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,948 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2025-01-09 22:47:03,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:47:03,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:47:03,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:47:03,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:47:03,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 22:47:03,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:03,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:04,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:04,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:04,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:04,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:04,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:47:04,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:47:04,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:47:04,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:47:04,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (1/1) ... [2025-01-09 22:47:04,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:47:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:04,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:47:04,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:47:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:47:04,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:47:04,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:47:04,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:47:04,148 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:47:04,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:47:04,393 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 22:47:04,393 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:47:04,407 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:47:04,407 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:47:04,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:47:04 BoogieIcfgContainer [2025-01-09 22:47:04,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:47:04,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:47:04,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:47:04,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:47:04,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:47:03" (1/3) ... [2025-01-09 22:47:04,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b22d242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:47:04, skipping insertion in model container [2025-01-09 22:47:04,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:03" (2/3) ... [2025-01-09 22:47:04,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b22d242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:47:04, skipping insertion in model container [2025-01-09 22:47:04,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:47:04" (3/3) ... [2025-01-09 22:47:04,419 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2025-01-09 22:47:04,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:47:04,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_14-2.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 22:47:04,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:47:04,495 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;@3fb832f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:47:04,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 22:47:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:47:04,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:04,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:47:04,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:04,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash 28938048, now seen corresponding path program 1 times [2025-01-09 22:47:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775860711] [2025-01-09 22:47:04,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:04,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:47:04,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:47:04,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:04,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:04,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775860711] [2025-01-09 22:47:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775860711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:04,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:04,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:47:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857755960] [2025-01-09 22:47:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:04,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:47:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:04,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:47:04,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:47:04,704 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:04,719 INFO L93 Difference]: Finished difference Result 54 states and 95 transitions. [2025-01-09 22:47:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:47:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-01-09 22:47:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:04,727 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:47:04,727 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:47:04,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:47:04,734 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:04,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:47:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 22:47:04,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.86) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2025-01-09 22:47:04,769 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 5 [2025-01-09 22:47:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:04,770 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 93 transitions. [2025-01-09 22:47:04,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2025-01-09 22:47:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:47:04,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:04,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:47:04,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:47:04,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:04,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash 889546222, now seen corresponding path program 1 times [2025-01-09 22:47:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:04,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479959520] [2025-01-09 22:47:04,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:04,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:47:04,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:47:04,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:04,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:04,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:04,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479959520] [2025-01-09 22:47:04,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479959520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:04,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:04,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:47:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612603091] [2025-01-09 22:47:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:04,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:04,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:04,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:04,855 INFO L87 Difference]: Start difference. First operand 52 states and 93 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:04,865 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2025-01-09 22:47:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:47:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:04,867 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:47:04,867 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:47:04,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:04,868 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:04,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:47:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:47:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2025-01-09 22:47:04,876 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 90 transitions. Word has length 6 [2025-01-09 22:47:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:04,876 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 90 transitions. [2025-01-09 22:47:04,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 90 transitions. [2025-01-09 22:47:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:47:04,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:04,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:04,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:47:04,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:04,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1780540654, now seen corresponding path program 1 times [2025-01-09 22:47:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:04,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535271480] [2025-01-09 22:47:04,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:04,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:04,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:04,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:04,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535271480] [2025-01-09 22:47:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535271480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99009598] [2025-01-09 22:47:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:04,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:04,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:04,993 INFO L87 Difference]: Start difference. First operand 49 states and 90 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:05,026 INFO L93 Difference]: Finished difference Result 95 states and 174 transitions. [2025-01-09 22:47:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:05,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:47:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:05,029 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:47:05,029 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:47:05,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:05,030 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:05,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:47:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-01-09 22:47:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2025-01-09 22:47:05,040 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 22 [2025-01-09 22:47:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:05,040 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2025-01-09 22:47:05,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2025-01-09 22:47:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:47:05,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:05,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:05,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:47:05,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1780317702, now seen corresponding path program 1 times [2025-01-09 22:47:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477419207] [2025-01-09 22:47:05,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:05,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:05,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:05,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:05,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:47:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477419207] [2025-01-09 22:47:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477419207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038497958] [2025-01-09 22:47:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:05,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:47:05,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:05,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:05,107 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:05,125 INFO L93 Difference]: Finished difference Result 129 states and 235 transitions. [2025-01-09 22:47:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:05,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:47:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:05,127 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:47:05,127 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:47:05,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:05,128 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 72 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:05,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:47:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2025-01-09 22:47:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.864) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 233 transitions. [2025-01-09 22:47:05,137 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 233 transitions. Word has length 22 [2025-01-09 22:47:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:05,137 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 233 transitions. [2025-01-09 22:47:05,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 233 transitions. [2025-01-09 22:47:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:47:05,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:05,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:05,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:47:05,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:05,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 926301692, now seen corresponding path program 1 times [2025-01-09 22:47:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:47:05,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156329683] [2025-01-09 22:47:05,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:47:05,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:47:05,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:47:05,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:05,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:05,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:05,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:47:05,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:47:05,211 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:47:05,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-01-09 22:47:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-01-09 22:47:05,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:47:05,216 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 22:47:05,257 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:47:05,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:47:05 BoogieIcfgContainer [2025-01-09 22:47:05,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:47:05,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:47:05,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:47:05,261 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:47:05,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:47:04" (3/4) ... [2025-01-09 22:47:05,264 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 22:47:05,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:47:05,266 INFO L158 Benchmark]: Toolchain (without parser) took 1613.56ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 105.3MB in the end (delta: 8.6MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-01-09 22:47:05,266 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:05,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.28ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 101.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:05,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.07ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:05,267 INFO L158 Benchmark]: Boogie Preprocessor took 65.01ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:05,267 INFO L158 Benchmark]: RCFGBuilder took 388.68ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 80.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:47:05,267 INFO L158 Benchmark]: TraceAbstraction took 850.22ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 106.0MB in the end (delta: -25.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:05,267 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 105.3MB in the end (delta: 711.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:05,269 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.28ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 101.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.07ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.01ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 388.68ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 80.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 850.22ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 106.0MB in the end (delta: -25.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 105.3MB in the end (delta: 711.5kB). 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L96] COND TRUE p3 != 0 [L97] lk3 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L120] COND FALSE !(p9 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L128] COND TRUE p11 != 0 [L129] lk11 = 1 VAL [lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L219] CALL reach_error() [L3] __assert_fail("0", "test_locks_14-2.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 493 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 373 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 22:47:05,289 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/locks/test_locks_14-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:47:07,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:47:07,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-09 22:47:07,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:47:07,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:47:07,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:47:07,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:47:07,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:47:07,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:47:07,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:47:07,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:47:07,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:47:07,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:47:07,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:47:07,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:47:07,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:47:07,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:47:07,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:47:07,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:47:07,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:47:07,761 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:47:07,761 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:47:07,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:47:07,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:47:07,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:47:07,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:47:07,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:47:07,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:47:07,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:47:07,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:47:07,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:47:07,765 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2025-01-09 22:47:08,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:47:08,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:47:08,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:47:08,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:47:08,060 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:47:08,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2025-01-09 22:47:09,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6df0a6c3/dd9cfb0bf83e4c4bbb59270613f2c5f2/FLAG96d1cc70e [2025-01-09 22:47:09,653 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:47:09,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2025-01-09 22:47:09,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6df0a6c3/dd9cfb0bf83e4c4bbb59270613f2c5f2/FLAG96d1cc70e [2025-01-09 22:47:09,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6df0a6c3/dd9cfb0bf83e4c4bbb59270613f2c5f2 [2025-01-09 22:47:09,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:47:09,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:47:09,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:47:09,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:47:09,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:47:09,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:09,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15460183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09, skipping insertion in model container [2025-01-09 22:47:09,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:09,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:47:09,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:47:09,893 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:47:09,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:47:09,942 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:47:09,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09 WrapperNode [2025-01-09 22:47:09,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:47:09,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:47:09,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:47:09,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:47:09,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:09,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:09,980 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2025-01-09 22:47:09,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:47:09,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:47:09,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:47:09,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:47:09,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:09,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:09,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,012 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 22:47:10,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:47:10,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:47:10,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:47:10,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:47:10,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (1/1) ... [2025-01-09 22:47:10,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:47:10,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:10,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:47:10,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:47:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:47:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:47:10,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:47:10,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 22:47:10,169 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:47:10,171 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:47:10,479 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 22:47:10,479 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:47:10,488 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:47:10,488 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:47:10,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:47:10 BoogieIcfgContainer [2025-01-09 22:47:10,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:47:10,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:47:10,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:47:10,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:47:10,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:47:09" (1/3) ... [2025-01-09 22:47:10,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a990c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:47:10, skipping insertion in model container [2025-01-09 22:47:10,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:47:09" (2/3) ... [2025-01-09 22:47:10,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a990c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:47:10, skipping insertion in model container [2025-01-09 22:47:10,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:47:10" (3/3) ... [2025-01-09 22:47:10,497 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2025-01-09 22:47:10,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:47:10,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_14-2.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 22:47:10,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:47:10,546 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;@6bf9681d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:47:10,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 22:47:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:47:10,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:10,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:47:10,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash 28938048, now seen corresponding path program 1 times [2025-01-09 22:47:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:47:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906980830] [2025-01-09 22:47:10,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:10,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:10,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:10,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:47:10,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:47:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:47:10,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:47:10,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:10,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:10,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 22:47:10,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:47:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:10,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:47:10,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:47:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906980830] [2025-01-09 22:47:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906980830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:47:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630326906] [2025-01-09 22:47:10,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:10,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:47:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:47:10,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:47:10,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:47:10,686 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:10,699 INFO L93 Difference]: Finished difference Result 54 states and 95 transitions. [2025-01-09 22:47:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:47:10,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2025-01-09 22:47:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:10,707 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:47:10,708 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:47:10,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:47:10,711 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:10,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:47:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 22:47:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.86) internal successors, (93), 51 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2025-01-09 22:47:10,751 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 5 [2025-01-09 22:47:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:10,751 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 93 transitions. [2025-01-09 22:47:10,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2025-01-09 22:47:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:47:10,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:10,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:47:10,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:47:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:10,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 889546222, now seen corresponding path program 1 times [2025-01-09 22:47:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:47:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086767105] [2025-01-09 22:47:10,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:10,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:10,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:10,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:47:10,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:47:11,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:47:11,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:47:11,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:11,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:11,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:47:11,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:47:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:11,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:47:11,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:47:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086767105] [2025-01-09 22:47:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086767105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:47:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464009113] [2025-01-09 22:47:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:11,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:47:11,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:11,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:11,043 INFO L87 Difference]: Start difference. First operand 52 states and 93 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:11,058 INFO L93 Difference]: Finished difference Result 51 states and 92 transitions. [2025-01-09 22:47:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:11,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:47:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:11,062 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:47:11,062 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:47:11,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:11,063 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:11,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:47:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:47:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 90 transitions. [2025-01-09 22:47:11,070 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 90 transitions. Word has length 6 [2025-01-09 22:47:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:11,070 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 90 transitions. [2025-01-09 22:47:11,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 90 transitions. [2025-01-09 22:47:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:47:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:11,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:11,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:47:11,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:11,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:11,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1780540654, now seen corresponding path program 1 times [2025-01-09 22:47:11,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:47:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006048425] [2025-01-09 22:47:11,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:11,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:47:11,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:47:11,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:11,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:11,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:11,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:11,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:47:11,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:47:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:11,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:47:11,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:47:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006048425] [2025-01-09 22:47:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006048425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:11,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:11,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:11,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147330438] [2025-01-09 22:47:11,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:11,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:47:11,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:11,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:11,408 INFO L87 Difference]: Start difference. First operand 49 states and 90 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:11,431 INFO L93 Difference]: Finished difference Result 95 states and 174 transitions. [2025-01-09 22:47:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:47:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:11,434 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:47:11,434 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:47:11,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:11,436 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:11,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:47:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-01-09 22:47:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2025-01-09 22:47:11,448 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 22 [2025-01-09 22:47:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:11,448 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2025-01-09 22:47:11,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2025-01-09 22:47:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:47:11,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:11,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:47:11,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:11,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:11,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1780317702, now seen corresponding path program 1 times [2025-01-09 22:47:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:47:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148411403] [2025-01-09 22:47:11,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:11,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:47:11,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:47:11,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:11,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:47:11,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 22:47:11,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:47:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:47:11,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:47:11,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:47:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148411403] [2025-01-09 22:47:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148411403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:47:11,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:47:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:47:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791599712] [2025-01-09 22:47:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:47:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:47:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:47:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:47:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:11,765 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:47:11,781 INFO L93 Difference]: Finished difference Result 129 states and 235 transitions. [2025-01-09 22:47:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:47:11,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 22:47:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:47:11,783 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:47:11,783 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:47:11,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:47:11,784 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 72 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:47:11,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:47:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:47:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2025-01-09 22:47:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.864) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 233 transitions. [2025-01-09 22:47:11,796 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 233 transitions. Word has length 22 [2025-01-09 22:47:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:47:11,796 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 233 transitions. [2025-01-09 22:47:11,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:47:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 233 transitions. [2025-01-09 22:47:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:47:11,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:47:11,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:47:11,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:47:11,997 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 [2025-01-09 22:47:11,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:47:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:47:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 926301692, now seen corresponding path program 1 times [2025-01-09 22:47:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:47:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415503718] [2025-01-09 22:47:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:47:11,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:11,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:47:12,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:47:12,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:47:12,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:12,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:12,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:12,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:47:12,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:47:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:47:12,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:47:12,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:47:12,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:47:12,102 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 22:47:12,102 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:47:12,103 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-01-09 22:47:12,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-01-09 22:47:12,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:47:12,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:47:12,308 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 22:47:12,344 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:47:12,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:47:12 BoogieIcfgContainer [2025-01-09 22:47:12,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:47:12,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:47:12,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:47:12,348 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:47:12,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:47:10" (3/4) ... [2025-01-09 22:47:12,353 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 22:47:12,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:47:12,354 INFO L158 Benchmark]: Toolchain (without parser) took 2667.54ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 57.7MB in the beginning and 76.0MB in the end (delta: -18.3MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-01-09 22:47:12,354 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:12,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.69ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 45.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:12,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.59ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:47:12,355 INFO L158 Benchmark]: Boogie Preprocessor took 51.06ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 42.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:12,355 INFO L158 Benchmark]: RCFGBuilder took 455.87ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 54.5MB in the end (delta: -12.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-01-09 22:47:12,355 INFO L158 Benchmark]: TraceAbstraction took 1856.14ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 54.1MB in the beginning and 76.0MB in the end (delta: -21.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2025-01-09 22:47:12,356 INFO L158 Benchmark]: Witness Printer took 6.07ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 76.0MB in the end (delta: 8.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:47:12,357 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.43ms. Allocated memory is still 83.9MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.69ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 45.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.59ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.06ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 42.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 455.87ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 54.5MB in the end (delta: -12.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1856.14ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 54.1MB in the beginning and 76.0MB in the end (delta: -21.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 6.07ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 76.0MB in the end (delta: 8.6kB). 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 - UnprovableResult [Line: 3]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND TRUE p3 != 0 [L97] lk3 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1] [L120] COND FALSE !(p9 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L128] COND TRUE p11 != 0 [L129] lk11 = 1 VAL [lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=1, p12=1, p13=1, p14=1, p1=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=1, p9=0] [L219] CALL reach_error() [L3] __assert_fail("0", "test_locks_14-2.c", 3, "reach_error") - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 493 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 373 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=4, InterpolantAutomatonStates: 11, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 22:47:12,375 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: UNKNOWN: Overapproximated counterexample