./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.i --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-15/cstrchr_reverse_alloca.i -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 c2261b8075e5a5018e09c71b2ef98f1a55d20ac7ba7a361137d9c5ebaba61150 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:31:33,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:31:33,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:31:33,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:31:33,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:31:33,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:31:33,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:31:33,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:31:33,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:31:33,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:31:33,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:31:33,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:31:33,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:31:33,640 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:31:33,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:31:33,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:31:33,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:31:33,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:31:33,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:31:33,643 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 -> c2261b8075e5a5018e09c71b2ef98f1a55d20ac7ba7a361137d9c5ebaba61150 [2025-03-04 07:31:33,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:31:33,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:31:33,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:31:33,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:31:33,910 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:31:33,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.i [2025-03-04 07:31:35,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a193246/f4c5ee56326e4a85a1b8563f81da44e5/FLAGae86def99 [2025-03-04 07:31:35,402 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:31:35,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.i [2025-03-04 07:31:35,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a193246/f4c5ee56326e4a85a1b8563f81da44e5/FLAGae86def99 [2025-03-04 07:31:35,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a193246/f4c5ee56326e4a85a1b8563f81da44e5 [2025-03-04 07:31:35,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:31:35,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:31:35,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:31:35,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:31:35,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:31:35,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:35,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721343d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35, skipping insertion in model container [2025-03-04 07:31:35,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:35,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:31:35,909 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:31:35,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:31:35,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:31:35,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:31:35,996 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:31:35,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35 WrapperNode [2025-03-04 07:31:35,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:31:35,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:31:35,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:31:35,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:31:36,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,028 INFO L138 Inliner]: procedures = 152, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-04 07:31:36,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:31:36,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:31:36,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:31:36,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:31:36,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,047 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-03-04 07:31:36,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:31:36,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:31:36,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:31:36,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:31:36,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (1/1) ... [2025-03-04 07:31:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:31:36,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:36,083 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 07:31:36,097 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 07:31:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:31:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:31:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:31:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:31:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:31:36,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:31:36,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:31:36,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:31:36,304 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc cstrchr_#t~mem209#1; [2025-03-04 07:31:36,305 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: call ULTIMATE.dealloc(main_#t~malloc211#1.base, main_#t~malloc211#1.offset);havoc main_#t~malloc211#1.base, main_#t~malloc211#1.offset; [2025-03-04 07:31:36,320 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-04 07:31:36,320 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:31:36,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:31:36,330 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:31:36,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:36 BoogieIcfgContainer [2025-03-04 07:31:36,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:31:36,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:31:36,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:31:36,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:31:36,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:31:35" (1/3) ... [2025-03-04 07:31:36,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787addfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:31:36, skipping insertion in model container [2025-03-04 07:31:36,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:35" (2/3) ... [2025-03-04 07:31:36,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787addfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:31:36, skipping insertion in model container [2025-03-04 07:31:36,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:36" (3/3) ... [2025-03-04 07:31:36,339 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrchr_reverse_alloca.i [2025-03-04 07:31:36,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:31:36,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrchr_reverse_alloca.i that has 1 procedures, 27 locations, 1 initial locations, 1 loop locations, and 9 error locations. [2025-03-04 07:31:36,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:31:36,393 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;@3faa940a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:31:36,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 07:31:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:31:36,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:36,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:31:36,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:36,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 61043678, now seen corresponding path program 1 times [2025-03-04 07:31:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318228258] [2025-03-04 07:31:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:36,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:31:36,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:31:36,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:36,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:36,586 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 07:31:36,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318228258] [2025-03-04 07:31:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318228258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798168324] [2025-03-04 07:31:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:36,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:36,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:36,615 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:36,658 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-04 07:31:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:36,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:31:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:36,665 INFO L225 Difference]: With dead ends: 26 [2025-03-04 07:31:36,666 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 07:31:36,668 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 07:31:36,670 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:36,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 07:31:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 07:31:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 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 07:31:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-04 07:31:36,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2025-03-04 07:31:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:36,695 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-04 07:31:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-04 07:31:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:31:36,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:36,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:31:36,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:31:36,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 61043679, now seen corresponding path program 1 times [2025-03-04 07:31:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413770921] [2025-03-04 07:31:36,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:31:36,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:31:36,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:36,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:36,863 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 07:31:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413770921] [2025-03-04 07:31:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413770921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:36,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:31:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308238853] [2025-03-04 07:31:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:36,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:31:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:36,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:31:36,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:36,866 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:36,903 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-03-04 07:31:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:31:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:31:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:36,905 INFO L225 Difference]: With dead ends: 23 [2025-03-04 07:31:36,905 INFO L226 Difference]: Without dead ends: 23 [2025-03-04 07:31:36,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:31:36,906 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:36,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-04 07:31:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-04 07:31:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-04 07:31:36,909 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 5 [2025-03-04 07:31:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:36,909 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-04 07:31:36,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-04 07:31:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:31:36,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:36,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:36,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:31:36,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:36,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1466567718, now seen corresponding path program 1 times [2025-03-04 07:31:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:36,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101010580] [2025-03-04 07:31:36,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:36,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:31:36,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:31:36,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:36,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:37,029 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 07:31:37,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101010580] [2025-03-04 07:31:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101010580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091879483] [2025-03-04 07:31:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:37,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:37,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:37,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:37,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:37,031 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:37,067 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-04 07:31:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:31:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:37,068 INFO L225 Difference]: With dead ends: 20 [2025-03-04 07:31:37,068 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 07:31:37,068 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 07:31:37,069 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:37,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 07:31:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 07:31:37,071 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 07:31:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-04 07:31:37,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2025-03-04 07:31:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:37,072 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-04 07:31:37,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-04 07:31:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:31:37,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:37,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:37,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:31:37,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1466567717, now seen corresponding path program 1 times [2025-03-04 07:31:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528503281] [2025-03-04 07:31:37,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:37,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:31:37,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:31:37,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:37,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:37,367 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 07:31:37,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528503281] [2025-03-04 07:31:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528503281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:37,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:31:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283231238] [2025-03-04 07:31:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:37,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:31:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:37,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:31:37,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:31:37,369 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:37,423 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-04 07:31:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:31:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:31:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:37,424 INFO L225 Difference]: With dead ends: 19 [2025-03-04 07:31:37,424 INFO L226 Difference]: Without dead ends: 19 [2025-03-04 07:31:37,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:31:37,424 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:37,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-04 07:31:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-04 07:31:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-04 07:31:37,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2025-03-04 07:31:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:37,427 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-04 07:31:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-04 07:31:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:31:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:37,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:37,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:31:37,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:37,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1033881598, now seen corresponding path program 1 times [2025-03-04 07:31:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512142520] [2025-03-04 07:31:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:37,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:31:37,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:31:37,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:37,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:37,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:37,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512142520] [2025-03-04 07:31:37,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512142520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:37,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216931314] [2025-03-04 07:31:37,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:37,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:37,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:37,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:37,457 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 07:31:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:37,466 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-04 07:31:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2025-03-04 07:31:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:37,467 INFO L225 Difference]: With dead ends: 20 [2025-03-04 07:31:37,467 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 07:31:37,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:37,468 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:37,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 07:31:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 07:31:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) 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 07:31:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-04 07:31:37,474 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2025-03-04 07:31:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:37,474 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-04 07:31:37,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 07:31:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-04 07:31:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:31:37,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:37,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:37,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:31:37,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:37,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1423642432, now seen corresponding path program 1 times [2025-03-04 07:31:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888455156] [2025-03-04 07:31:37,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:37,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:31:37,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:31:37,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:37,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:37,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:37,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888455156] [2025-03-04 07:31:37,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888455156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:37,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535751947] [2025-03-04 07:31:37,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:37,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:37,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:37,853 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 07:31:37,859 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 07:31:37,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:31:37,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:31:37,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:37,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:37,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:31:37,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:37,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:31:38,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:31:38,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 07:31:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:38,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:31:38,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:31:38,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 07:31:38,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 07:31:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535751947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:31:38,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:31:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2025-03-04 07:31:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354739345] [2025-03-04 07:31:38,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:31:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:31:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:38,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:31:38,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:31:38,394 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:38,713 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-03-04 07:31:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:31:38,714 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:31:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:38,715 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:31:38,716 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:31:38,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:31:38,717 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:38,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 109 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:31:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:31:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2025-03-04 07:31:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-04 07:31:38,723 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2025-03-04 07:31:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:38,723 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-04 07:31:38,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-04 07:31:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:31:38,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:38,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:38,730 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 07:31:38,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:31:38,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1157599727, now seen corresponding path program 1 times [2025-03-04 07:31:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207697964] [2025-03-04 07:31:38,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:38,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:31:38,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:31:38,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:38,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:38,979 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 07:31:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207697964] [2025-03-04 07:31:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207697964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:31:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777796924] [2025-03-04 07:31:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:38,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:38,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:38,981 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:38,996 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-04 07:31:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 07:31:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:38,997 INFO L225 Difference]: With dead ends: 25 [2025-03-04 07:31:38,997 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 07:31:38,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 07:31:38,998 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:38,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 07:31:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 07:31:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-03-04 07:31:39,001 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2025-03-04 07:31:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-04 07:31:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-03-04 07:31:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:31:39,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:39,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:39,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:31:39,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-03-04 07:31:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash -8786459, now seen corresponding path program 2 times [2025-03-04 07:31:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:39,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560490300] [2025-03-04 07:31:39,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:31:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:39,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 07:31:39,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:31:39,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:31:39,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560490300] [2025-03-04 07:31:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560490300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:31:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32652418] [2025-03-04 07:31:39,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:31:39,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:31:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:39,369 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 07:31:39,371 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 07:31:39,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 07:31:39,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:31:39,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:31:39,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:39,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:31:39,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:31:39,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:31:39,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:31:39,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:31:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:39,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:31:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-03-04 07:31:39,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 07:31:39,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 07:31:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32652418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:31:39,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:31:39,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2025-03-04 07:31:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477330942] [2025-03-04 07:31:39,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:31:39,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:31:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:39,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:31:39,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:31:39,892 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 07:31:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:40,112 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-04 07:31:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:31:40,113 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 19 [2025-03-04 07:31:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:40,113 INFO L225 Difference]: With dead ends: 24 [2025-03-04 07:31:40,113 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:31:40,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:31:40,114 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:40,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:31:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:31:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:31:40,115 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 07:31:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:31:40,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2025-03-04 07:31:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:40,115 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:31:40,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 23 states have internal predecessors, (40), 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 07:31:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:31:40,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:31:40,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2025-03-04 07:31:40,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-03-04 07:31:40,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-03-04 07:31:40,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-03-04 07:31:40,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-03-04 07:31:40,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-03-04 07:31:40,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-03-04 07:31:40,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-03-04 07:31:40,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2025-03-04 07:31:40,130 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 07:31:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 07:31:40,327 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:40,329 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:31:40,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:31:40 BoogieIcfgContainer [2025-03-04 07:31:40,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:31:40,332 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:31:40,332 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:31:40,332 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:31:40,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:36" (3/4) ... [2025-03-04 07:31:40,335 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:31:40,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 07:31:40,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 07:31:40,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:31:40,343 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:31:40,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:31:40,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:31:40,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:31:40,408 INFO L158 Benchmark]: Toolchain (without parser) took 4732.56ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 42.0MB in the end (delta: 62.7MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2025-03-04 07:31:40,408 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:40,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.51ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 86.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:31:40,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 85.3MB in the end (delta: 892.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:40,409 INFO L158 Benchmark]: Boogie Preprocessor took 22.08ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 84.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:40,409 INFO L158 Benchmark]: IcfgBuilder took 278.24ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 69.2MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:40,409 INFO L158 Benchmark]: TraceAbstraction took 3998.53ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 47.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-03-04 07:31:40,410 INFO L158 Benchmark]: Witness Printer took 75.13ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 42.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:40,412 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.56ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.51ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 86.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 85.3MB in the end (delta: 892.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.08ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 84.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 278.24ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 69.2MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3998.53ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 47.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Witness Printer took 75.13ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 42.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 370]: 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 - 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, 27 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 120 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 55, 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, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 7 QuantifiedInterpolants, 1322 SizeOfPredicates, 11 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 5/28 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:31:40,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE