./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 08:03:51,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:03:52,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 08:03:52,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:03:52,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:03:52,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:03:52,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:03:52,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:03:52,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:03:52,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:03:52,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:03:52,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:03:52,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:03:52,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:03:52,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:03:52,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:03:52,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:03:52,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:03:52,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:03:52,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:03:52,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:03:52,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:03:52,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:03:52,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2025-03-04 08:03:52,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:03:52,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:03:52,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:03:52,260 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:03:52,260 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:03:52,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2025-03-04 08:03:53,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb465b60/88889a0a274c471fb803ed66440d9799/FLAGea5546a0c [2025-03-04 08:03:53,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:03:53,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2025-03-04 08:03:53,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb465b60/88889a0a274c471fb803ed66440d9799/FLAGea5546a0c [2025-03-04 08:03:53,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb465b60/88889a0a274c471fb803ed66440d9799 [2025-03-04 08:03:53,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:03:53,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:03:53,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:03:53,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:03:53,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:03:53,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd14c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53, skipping insertion in model container [2025-03-04 08:03:53,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:03:53,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:03:53,717 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:03:53,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:03:53,741 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:03:53,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53 WrapperNode [2025-03-04 08:03:53,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:03:53,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:03:53,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:03:53,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:03:53,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,762 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-03-04 08:03:53,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:03:53,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:03:53,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:03:53,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:03:53,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,783 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 08:03:53,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:03:53,790 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:03:53,790 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:03:53,790 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:03:53,791 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (1/1) ... [2025-03-04 08:03:53,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:03:53,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:53,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 08:03:53,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 08:03:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 08:03:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:03:53,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:03:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 08:03:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 08:03:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 08:03:53,875 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:03:53,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:03:53,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-04 08:03:53,981 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 08:03:53,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:03:53,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:03:53,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:03:53,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:53 BoogieIcfgContainer [2025-03-04 08:03:53,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:03:53,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:03:53,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:03:53,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:03:53,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:03:53" (1/3) ... [2025-03-04 08:03:53,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eedb16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:03:53, skipping insertion in model container [2025-03-04 08:03:53,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:53" (2/3) ... [2025-03-04 08:03:53,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eedb16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:03:53, skipping insertion in model container [2025-03-04 08:03:53,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:53" (3/3) ... [2025-03-04 08:03:53,995 INFO L128 eAbstractionObserver]: Analyzing ICFG NonTermination3-2.c [2025-03-04 08:03:54,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:03:54,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NonTermination3-2.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 08:03:54,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:03:54,039 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;@2e21c5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:03:54,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 08:03:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:03:54,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:03:54,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:54,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:54,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1722878, now seen corresponding path program 1 times [2025-03-04 08:03:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374903113] [2025-03-04 08:03:54,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:54,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:03:54,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:03:54,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:54,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374903113] [2025-03-04 08:03:54,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374903113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:54,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:54,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917419829] [2025-03-04 08:03:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:54,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:54,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:54,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,216 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:54,258 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-04 08:03:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:03:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:54,264 INFO L225 Difference]: With dead ends: 20 [2025-03-04 08:03:54,264 INFO L226 Difference]: Without dead ends: 18 [2025-03-04 08:03:54,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,267 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:54,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-04 08:03:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-04 08:03:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-04 08:03:54,293 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 4 [2025-03-04 08:03:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:54,293 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-04 08:03:54,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-04 08:03:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:03:54,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:03:54,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 08:03:54,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1722879, now seen corresponding path program 1 times [2025-03-04 08:03:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351447808] [2025-03-04 08:03:54,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:54,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:03:54,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:03:54,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351447808] [2025-03-04 08:03:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351447808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:54,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:54,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:54,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842352414] [2025-03-04 08:03:54,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:54,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:54,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:54,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,403 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:54,435 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-04 08:03:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:03:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:54,436 INFO L225 Difference]: With dead ends: 21 [2025-03-04 08:03:54,436 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 08:03:54,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:54,438 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:54,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 08:03:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-04 08:03:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-04 08:03:54,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2025-03-04 08:03:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:54,440 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-04 08:03:54,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-04 08:03:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 08:03:54,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,441 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 08:03:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 08:03:54,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -213358858, now seen corresponding path program 1 times [2025-03-04 08:03:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618626831] [2025-03-04 08:03:54,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:54,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:03:54,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:03:54,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618626831] [2025-03-04 08:03:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618626831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082060592] [2025-03-04 08:03:54,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:54,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:54,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 08:03:54,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:03:54,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:03:54,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:54,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:54,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 08:03:54,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:54,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:03:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082060592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:54,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 08:03:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215969449] [2025-03-04 08:03:54,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:54,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 08:03:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:54,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 08:03:54,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:03:54,775 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:54,838 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-04 08:03:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:03:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 08:03:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:54,840 INFO L225 Difference]: With dead ends: 29 [2025-03-04 08:03:54,840 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 08:03:54,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:03:54,841 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:54,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 08:03:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 08:03:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-04 08:03:54,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 7 [2025-03-04 08:03:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:54,848 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-04 08:03:54,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-04 08:03:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 08:03:54,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:54,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:54,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 08:03:55,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1987539875, now seen corresponding path program 1 times [2025-03-04 08:03:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223086764] [2025-03-04 08:03:55,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 08:03:55,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 08:03:55,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 08:03:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223086764] [2025-03-04 08:03:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223086764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:55,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 08:03:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71297706] [2025-03-04 08:03:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:55,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:03:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:55,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:03:55,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:03:55,192 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:55,247 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-04 08:03:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:03:55,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 08:03:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:55,248 INFO L225 Difference]: With dead ends: 29 [2025-03-04 08:03:55,248 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 08:03:55,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:03:55,248 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:55,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 08:03:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-04 08:03:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 08:03:55,252 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2025-03-04 08:03:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 08:03:55,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 08:03:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 08:03:55,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:55,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:55,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 08:03:55,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1234652917, now seen corresponding path program 1 times [2025-03-04 08:03:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374101654] [2025-03-04 08:03:55,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 08:03:55,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 08:03:55,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374101654] [2025-03-04 08:03:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374101654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713130109] [2025-03-04 08:03:55,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:55,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:55,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 08:03:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 08:03:55,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 08:03:55,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:55,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 08:03:55,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713130109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:55,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 08:03:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639828942] [2025-03-04 08:03:55,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:55,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 08:03:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:55,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 08:03:55,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:03:55,408 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:55,441 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-04 08:03:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:03:55,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 08:03:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:55,443 INFO L225 Difference]: With dead ends: 32 [2025-03-04 08:03:55,443 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 08:03:55,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:03:55,445 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:55,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 08:03:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 08:03:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-04 08:03:55,447 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2025-03-04 08:03:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:55,448 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-04 08:03:55,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-04 08:03:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:03:55,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:55,448 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-04 08:03:55,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:55,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:55,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 597615423, now seen corresponding path program 2 times [2025-03-04 08:03:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:55,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860150711] [2025-03-04 08:03:55,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:55,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:03:55,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:03:55,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:55,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:55,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860150711] [2025-03-04 08:03:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860150711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464494731] [2025-03-04 08:03:55,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:55,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:55,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 08:03:55,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 08:03:55,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 08:03:55,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:03:55,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:55,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:55,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 08:03:55,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:55,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 08:03:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:56,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 08:03:56,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464494731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:56,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 08:03:56,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-03-04 08:03:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969069658] [2025-03-04 08:03:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 08:03:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:56,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 08:03:56,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-04 08:03:56,020 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:56,053 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-03-04 08:03:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:03:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:03:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:56,054 INFO L225 Difference]: With dead ends: 31 [2025-03-04 08:03:56,054 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 08:03:56,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-04 08:03:56,054 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:56,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 08:03:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 08:03:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-03-04 08:03:56,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 16 [2025-03-04 08:03:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:56,057 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-03-04 08:03:56,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-03-04 08:03:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 08:03:56,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:56,057 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:56,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:56,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 08:03:56,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1071818699, now seen corresponding path program 2 times [2025-03-04 08:03:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:56,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163842050] [2025-03-04 08:03:56,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:56,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 08:03:56,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 26 statements. [2025-03-04 08:03:56,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:03:56,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 08:03:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163842050] [2025-03-04 08:03:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163842050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:03:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417425120] [2025-03-04 08:03:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:56,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:03:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:56,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:03:56,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:03:56,301 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:56,311 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-04 08:03:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:03:56,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 26 [2025-03-04 08:03:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:56,312 INFO L225 Difference]: With dead ends: 30 [2025-03-04 08:03:56,312 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 08:03:56,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:03:56,313 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:56,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 08:03:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 08:03:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 08:03:56,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-04 08:03:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 08:03:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 08:03:56,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-03-04 08:03:56,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2025-03-04 08:03:56,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 08:03:56,322 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 08:03:56,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 08:03:56,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 08:03:56 BoogieIcfgContainer [2025-03-04 08:03:56,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 08:03:56,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 08:03:56,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 08:03:56,326 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 08:03:56,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:53" (3/4) ... [2025-03-04 08:03:56,328 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 08:03:56,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 08:03:56,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 08:03:56,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 08:03:56,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 08:03:56,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 08:03:56,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 08:03:56,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 08:03:56,383 INFO L158 Benchmark]: Toolchain (without parser) took 2779.81ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 113.1MB in the end (delta: 20.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2025-03-04 08:03:56,383 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:56,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.19ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 122.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:03:56,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.69ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:56,384 INFO L158 Benchmark]: Boogie Preprocessor took 26.22ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:56,384 INFO L158 Benchmark]: IcfgBuilder took 197.76ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 108.9MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 08:03:56,384 INFO L158 Benchmark]: TraceAbstraction took 2335.99ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 118.4MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:56,384 INFO L158 Benchmark]: Witness Printer took 56.78ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 113.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:03:56,385 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.18ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.19ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 122.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.69ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.22ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 120.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.76ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 108.9MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2335.99ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 118.4MB in the end (delta: -10.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.78ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 113.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 9]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 98 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 120 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 91/129 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 08:03:56,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE