./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strcasecmp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-dietlibc/strcasecmp.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4b83d1547bf3dd46e9571984e7e0a13f5187eff03a7662628a99d75ecc5b0412 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:10:55,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:10:55,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:10:55,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:10:55,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:10:55,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:10:55,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:10:55,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:10:55,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:10:55,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:10:55,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:10:55,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:10:55,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:10:55,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:10:55,330 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:10:55,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:10:55,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:10:55,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:10:55,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:10:55,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:10:55,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:10:55,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:10:55,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:10:55,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:10:55,334 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b83d1547bf3dd46e9571984e7e0a13f5187eff03a7662628a99d75ecc5b0412 [2025-01-09 22:10:55,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:10:55,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:10:55,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:10:55,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:10:55,562 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:10:55,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcasecmp.i [2025-01-09 22:10:56,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea60a8ef7/8a74827e33ee4ad0854eb0d76c599e0c/FLAGf68101c64 [2025-01-09 22:10:57,135 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:10:57,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcasecmp.i [2025-01-09 22:10:57,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea60a8ef7/8a74827e33ee4ad0854eb0d76c599e0c/FLAGf68101c64 [2025-01-09 22:10:57,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea60a8ef7/8a74827e33ee4ad0854eb0d76c599e0c [2025-01-09 22:10:57,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:10:57,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:10:57,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:10:57,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:10:57,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:10:57,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6721d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57, skipping insertion in model container [2025-01-09 22:10:57,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:10:57,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:10:57,572 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:10:57,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:10:57,612 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:10:57,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57 WrapperNode [2025-01-09 22:10:57,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:10:57,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:10:57,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:10:57,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:10:57,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,635 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-01-09 22:10:57,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:10:57,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:10:57,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:10:57,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:10:57,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,651 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-01-09 22:10:57,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:10:57,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:10:57,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:10:57,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:10:57,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (1/1) ... [2025-01-09 22:10:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:10:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:57,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:10:57,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:10:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:10:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:10:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:10:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:10:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:10:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:10:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:10:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:10:57,774 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:10:57,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:10:57,950 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 22:10:57,950 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:10:57,956 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:10:57,957 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:10:57,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:57 BoogieIcfgContainer [2025-01-09 22:10:57,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:10:57,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:10:57,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:10:57,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:10:57,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:10:57" (1/3) ... [2025-01-09 22:10:57,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6581717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:57, skipping insertion in model container [2025-01-09 22:10:57,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:57" (2/3) ... [2025-01-09 22:10:57,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6581717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:57, skipping insertion in model container [2025-01-09 22:10:57,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:57" (3/3) ... [2025-01-09 22:10:57,965 INFO L128 eAbstractionObserver]: Analyzing ICFG strcasecmp.i [2025-01-09 22:10:57,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:10:57,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strcasecmp.i that has 1 procedures, 41 locations, 1 initial locations, 3 loop locations, and 13 error locations. [2025-01-09 22:10:58,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:10:58,016 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;@75d0e0a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:10:58,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 22:10:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:10:58,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:58,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:10:58,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:58,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash 925680, now seen corresponding path program 1 times [2025-01-09 22:10:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069998595] [2025-01-09 22:10:58,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:58,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:58,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:10:58,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:10:58,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:58,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069998595] [2025-01-09 22:10:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069998595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:58,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:10:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593245225] [2025-01-09 22:10:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:10:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:58,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:10:58,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:10:58,192 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:58,239 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-01-09 22:10:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:10:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:10:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:58,248 INFO L225 Difference]: With dead ends: 42 [2025-01-09 22:10:58,248 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:10:58,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:10:58,251 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:58,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:10:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 22:10:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-01-09 22:10:58,280 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 4 [2025-01-09 22:10:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-01-09 22:10:58,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-01-09 22:10:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:10:58,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:58,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:10:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:10:58,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 28696006, now seen corresponding path program 1 times [2025-01-09 22:10:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530149808] [2025-01-09 22:10:58,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:58,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:10:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:10:58,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:58,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530149808] [2025-01-09 22:10:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530149808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:10:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122457878] [2025-01-09 22:10:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:10:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:58,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:10:58,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:10:58,353 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. 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-01-09 22:10:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:58,389 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-01-09 22:10:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:10:58,389 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-01-09 22:10:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:58,390 INFO L225 Difference]: With dead ends: 37 [2025-01-09 22:10:58,390 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 22:10:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:10:58,391 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:58,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 22:10:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 22:10:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-09 22:10:58,393 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 5 [2025-01-09 22:10:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:58,393 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-09 22:10:58,393 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-01-09 22:10:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-01-09 22:10:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:10:58,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:58,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:10:58,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:10:58,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:58,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash 28696007, now seen corresponding path program 1 times [2025-01-09 22:10:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083197005] [2025-01-09 22:10:58,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:58,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:10:58,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:10:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:58,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083197005] [2025-01-09 22:10:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083197005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:58,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:10:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521167517] [2025-01-09 22:10:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:58,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:10:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:58,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:10:58,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:58,592 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:58,648 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-01-09 22:10:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:10:58,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:10:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:58,649 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:10:58,649 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:10:58,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:58,650 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:58,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:10:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2025-01-09 22:10:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-01-09 22:10:58,656 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 5 [2025-01-09 22:10:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-01-09 22:10:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-01-09 22:10:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:10:58,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:58,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:10:58,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:10:58,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:58,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2025-01-09 22:10:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:58,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602725197] [2025-01-09 22:10:58,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:58,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:10:58,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:10:58,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:58,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602725197] [2025-01-09 22:10:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602725197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:58,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:10:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213322172] [2025-01-09 22:10:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:58,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:10:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:58,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:10:58,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:10:58,846 INFO L87 Difference]: Start difference. First operand 39 states and 46 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-01-09 22:10:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:58,914 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-01-09 22:10:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:10:58,915 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-01-09 22:10:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:58,915 INFO L225 Difference]: With dead ends: 43 [2025-01-09 22:10:58,916 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:10:58,916 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-01-09 22:10:58,917 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:58,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:10:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-01-09 22:10:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-01-09 22:10:58,924 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 5 [2025-01-09 22:10:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:58,924 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-01-09 22:10:58,924 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-01-09 22:10:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-01-09 22:10:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:10:58,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:58,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:58,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:10:58,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 184214058, now seen corresponding path program 1 times [2025-01-09 22:10:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217562809] [2025-01-09 22:10:58,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:58,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:10:58,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:10:58,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:58,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217562809] [2025-01-09 22:10:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217562809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:10:59,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:10:59,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:10:59,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876247254] [2025-01-09 22:10:59,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:59,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:10:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:59,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:10:59,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:10:59,021 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:59,052 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-01-09 22:10:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:10:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:10:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:59,053 INFO L225 Difference]: With dead ends: 41 [2025-01-09 22:10:59,053 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 22:10:59,053 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-01-09 22:10:59,054 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:59,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 22:10:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 22:10:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-01-09 22:10:59,059 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 8 [2025-01-09 22:10:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:59,059 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-01-09 22:10:59,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-01-09 22:10:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:10:59,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:59,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:10:59,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 178488141, now seen corresponding path program 1 times [2025-01-09 22:10:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929287733] [2025-01-09 22:10:59,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:59,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:10:59,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:10:59,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:59,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:10:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929287733] [2025-01-09 22:10:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929287733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212517526] [2025-01-09 22:10:59,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:59,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:59,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:10:59,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:10:59,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:10:59,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:10:59,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:10:59,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:59,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:10:59,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 22:10:59,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:10:59,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 22:10:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:59,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:10:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:10:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212517526] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 22:10:59,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:10:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-01-09 22:10:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317720230] [2025-01-09 22:10:59,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:10:59,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:10:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:10:59,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:10:59,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:10:59,540 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:10:59,599 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-01-09 22:10:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:10:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:10:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:10:59,599 INFO L225 Difference]: With dead ends: 39 [2025-01-09 22:10:59,599 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:10:59,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:10:59,600 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:10:59,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:10:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:10:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-09 22:10:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-01-09 22:10:59,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 8 [2025-01-09 22:10:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:10:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-01-09 22:10:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:10:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-01-09 22:10:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:10:59,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:10:59,604 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:10:59,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:10:59,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:10:59,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:10:59,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:10:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash 178487949, now seen corresponding path program 1 times [2025-01-09 22:10:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:10:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024237353] [2025-01-09 22:10:59,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:10:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:10:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:10:59,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:10:59,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:10:59,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:00,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024237353] [2025-01-09 22:11:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024237353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:11:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074009969] [2025-01-09 22:11:00,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:00,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:00,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:11:00,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:11:00,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:11:00,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:11:00,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:11:00,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:00,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:00,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:11:00,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:11:00,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 22:11:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:00,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:11:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074009969] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:11:00,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:11:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-09 22:11:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926171406] [2025-01-09 22:11:00,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:11:00,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:11:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:11:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:11:00,331 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:00,439 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-01-09 22:11:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:11:00,440 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:11:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:00,440 INFO L225 Difference]: With dead ends: 39 [2025-01-09 22:11:00,440 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 22:11:00,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:11:00,441 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:00,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 156 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:11:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 22:11:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-01-09 22:11:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 34 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-01-09 22:11:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-09 22:11:00,443 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2025-01-09 22:11:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:00,443 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-09 22:11:00,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-09 22:11:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:11:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:00,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:00,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:11:00,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:11:00,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:11:00,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1415669036, now seen corresponding path program 1 times [2025-01-09 22:11:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783943801] [2025-01-09 22:11:00,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:00,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:11:00,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:11:00,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:00,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783943801] [2025-01-09 22:11:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783943801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:11:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011836378] [2025-01-09 22:11:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:11:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:11:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:00,691 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:00,708 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-01-09 22:11:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:11:00,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:11:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:00,709 INFO L225 Difference]: With dead ends: 33 [2025-01-09 22:11:00,709 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 22:11:00,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:11:00,709 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:00,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 22:11:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-09 22:11:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-01-09 22:11:00,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2025-01-09 22:11:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:00,715 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-01-09 22:11:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-01-09 22:11:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:11:00,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:00,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:11:00,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:11:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1415669037, now seen corresponding path program 1 times [2025-01-09 22:11:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-09 22:11:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:00,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:11:00,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:11:00,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:00,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:00,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-09 22:11:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776024483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:00,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:11:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060235808] [2025-01-09 22:11:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:11:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:00,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:11:00,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:00,869 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:00,923 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-01-09 22:11:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:11:00,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:11:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:00,924 INFO L225 Difference]: With dead ends: 37 [2025-01-09 22:11:00,924 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 22:11:00,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:11:00,925 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:00,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 22:11:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-01-09 22:11:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-09 22:11:00,927 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 9 [2025-01-09 22:11:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:00,927 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-09 22:11:00,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-09 22:11:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:11:00,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:00,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:11:00,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:11:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1046688912, now seen corresponding path program 1 times [2025-01-09 22:11:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769703626] [2025-01-09 22:11:00,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:00,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:11:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:11:00,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:00,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769703626] [2025-01-09 22:11:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769703626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:00,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:11:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766461451] [2025-01-09 22:11:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:00,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:11:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:00,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:11:00,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:11:00,952 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:00,978 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-01-09 22:11:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:11:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 22:11:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:00,979 INFO L225 Difference]: With dead ends: 35 [2025-01-09 22:11:00,979 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 22:11:00,979 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-01-09 22:11:00,980 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:00,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 22:11:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 22:11:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-01-09 22:11:00,981 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 11 [2025-01-09 22:11:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:00,981 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-01-09 22:11:00,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-01-09 22:11:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:11:00,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:00,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:00,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:11:00,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:11:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1046688911, now seen corresponding path program 1 times [2025-01-09 22:11:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810432543] [2025-01-09 22:11:00,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:00,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:11:00,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:11:00,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:00,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:11:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:11:01,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:11:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810432543] [2025-01-09 22:11:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810432543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:11:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:11:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:11:01,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864917654] [2025-01-09 22:11:01,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:11:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:11:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:11:01,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:11:01,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:11:01,046 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-01-09 22:11:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:11:01,092 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-01-09 22:11:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:11:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-01-09 22:11:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:11:01,093 INFO L225 Difference]: With dead ends: 44 [2025-01-09 22:11:01,093 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:11:01,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:11:01,093 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:11:01,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 87 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:11:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:11:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2025-01-09 22:11:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:11:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-09 22:11:01,096 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2025-01-09 22:11:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:11:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-09 22:11:01,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-01-09 22:11:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-09 22:11:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 22:11:01,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:11:01,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:01,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:11:01,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-01-09 22:11:01,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:11:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1906656218, now seen corresponding path program 1 times [2025-01-09 22:11:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:11:01,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397873882] [2025-01-09 22:11:01,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:11:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:11:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:11:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:11:01,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:01,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:11:01,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:11:01,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 22:11:01,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 22:11:01,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:11:01,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:11:01,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:11:01,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:11:01,131 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2025-01-09 22:11:01,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-01-09 22:11:01,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-01-09 22:11:01,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-01-09 22:11:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:11:01,137 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:11:01,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:11:01,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:11:01 BoogieIcfgContainer [2025-01-09 22:11:01,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:11:01,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:11:01,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:11:01,156 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:11:01,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:57" (3/4) ... [2025-01-09 22:11:01,157 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 22:11:01,191 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-01-09 22:11:01,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:11:01,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:11:01,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:11:01,225 INFO L158 Benchmark]: Toolchain (without parser) took 3825.20ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 40.4MB in the end (delta: 65.4MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2025-01-09 22:11:01,225 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:11:01,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.02ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 89.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:11:01,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.52ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:11:01,226 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:11:01,226 INFO L158 Benchmark]: RCFGBuilder took 297.34ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 70.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:11:01,226 INFO L158 Benchmark]: TraceAbstraction took 3196.41ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 45.0MB in the end (delta: 24.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-01-09 22:11:01,227 INFO L158 Benchmark]: Witness Printer took 68.05ms. Allocated memory is still 142.6MB. Free memory was 45.0MB in the beginning and 40.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:11:01,229 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.97ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.02ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 89.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.52ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.34ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 70.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3196.41ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 45.0MB in the end (delta: 24.6MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 68.05ms. Allocated memory is still 142.6MB. Free memory was 45.0MB in the beginning and 40.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int in_len = __VERIFIER_nondet_int(); [L524] COND FALSE !(in_len < 1) [L525] char* in = __builtin_alloca (in_len); [L526] int i=0; VAL [i=0, in={3:0}, in_len=1] [L526] COND FALSE !(i