./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label59.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3365f1635b74f6a53afd889ed9f5ab40e7b8a98b6d57619b7925d1a2f204728 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:31:17,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:31:17,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:31:17,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:31:17,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:31:17,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:31:17,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:31:17,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:31:17,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:31:17,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:31:17,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:31:17,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:31:17,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:31:17,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:17,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:31:17,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:31:17,891 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3365f1635b74f6a53afd889ed9f5ab40e7b8a98b6d57619b7925d1a2f204728 [2025-03-03 10:31:18,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:31:18,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:31:18,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:31:18,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:31:18,105 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:31:18,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2025-03-03 10:31:19,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8057aa9/8af65de9877947d7aaf6ee03b12406cb/FLAGb4befa532 [2025-03-03 10:31:19,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:31:19,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2025-03-03 10:31:19,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8057aa9/8af65de9877947d7aaf6ee03b12406cb/FLAGb4befa532 [2025-03-03 10:31:19,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8057aa9/8af65de9877947d7aaf6ee03b12406cb [2025-03-03 10:31:19,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:31:19,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:31:19,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:19,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:31:19,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:31:19,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:19" (1/1) ... [2025-03-03 10:31:19,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471a0bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:19, skipping insertion in model container [2025-03-03 10:31:19,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:31:19" (1/1) ... [2025-03-03 10:31:19,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:31:19,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c[7385,7398] [2025-03-03 10:31:20,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:20,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:31:20,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c[7385,7398] [2025-03-03 10:31:20,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:31:20,101 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:31:20,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20 WrapperNode [2025-03-03 10:31:20,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:31:20,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:20,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:31:20,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:31:20,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,161 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-03 10:31:20,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:31:20,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:31:20,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:31:20,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:31:20,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,205 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:31:20,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:31:20,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:31:20,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:31:20,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:31:20,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (1/1) ... [2025-03-03 10:31:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:31:20,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:20,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:31:20,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:31:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:31:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:31:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:31:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:31:20,349 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:31:20,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:31:21,196 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 10:31:21,196 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:31:21,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:31:21,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:31:21,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:21 BoogieIcfgContainer [2025-03-03 10:31:21,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:31:21,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:31:21,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:31:21,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:31:21,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:31:19" (1/3) ... [2025-03-03 10:31:21,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4949b22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:21, skipping insertion in model container [2025-03-03 10:31:21,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:31:20" (2/3) ... [2025-03-03 10:31:21,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4949b22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:31:21, skipping insertion in model container [2025-03-03 10:31:21,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:21" (3/3) ... [2025-03-03 10:31:21,224 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label59.c [2025-03-03 10:31:21,239 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:31:21,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label59.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:31:21,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:31:21,298 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=LoopHeads, 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;@2fb79a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:31:21,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:31:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 10:31:21,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:21,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:21,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:21,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 599624870, now seen corresponding path program 1 times [2025-03-03 10:31:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:21,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564444908] [2025-03-03 10:31:21,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:21,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 10:31:21,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 10:31:21,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:21,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:21,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:21,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564444908] [2025-03-03 10:31:21,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564444908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:21,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:21,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:21,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829020347] [2025-03-03 10:31:21,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:21,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:21,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:21,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:21,678 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:22,297 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-03-03 10:31:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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 65 [2025-03-03 10:31:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:22,308 INFO L225 Difference]: With dead ends: 567 [2025-03-03 10:31:22,309 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 10:31:22,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:22,316 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:22,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 32 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:31:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 10:31:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-03 10:31:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2025-03-03 10:31:22,358 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 65 [2025-03-03 10:31:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:22,358 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2025-03-03 10:31:22,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2025-03-03 10:31:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 10:31:22,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:22,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:22,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:31:22,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:22,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash -538891093, now seen corresponding path program 1 times [2025-03-03 10:31:22,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:22,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761585787] [2025-03-03 10:31:22,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:22,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 10:31:22,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 10:31:22,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:22,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:22,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:22,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761585787] [2025-03-03 10:31:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761585787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:22,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60982598] [2025-03-03 10:31:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:22,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:22,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:22,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:22,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:22,635 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:23,054 INFO L93 Difference]: Finished difference Result 840 states and 1291 transitions. [2025-03-03 10:31:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:23,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2025-03-03 10:31:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:23,060 INFO L225 Difference]: With dead ends: 840 [2025-03-03 10:31:23,060 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 10:31:23,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:23,061 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 77 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:23,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 226 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 10:31:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 10:31:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2025-03-03 10:31:23,088 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 131 [2025-03-03 10:31:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:23,089 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2025-03-03 10:31:23,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2025-03-03 10:31:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 10:31:23,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:23,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:31:23,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1354371781, now seen corresponding path program 1 times [2025-03-03 10:31:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138847542] [2025-03-03 10:31:23,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:23,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 10:31:23,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 10:31:23,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:23,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:23,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:23,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138847542] [2025-03-03 10:31:23,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138847542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:23,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250798455] [2025-03-03 10:31:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:23,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:23,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:23,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:23,306 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:23,690 INFO L93 Difference]: Finished difference Result 1257 states and 1672 transitions. [2025-03-03 10:31:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:23,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 138 [2025-03-03 10:31:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:23,694 INFO L225 Difference]: With dead ends: 1257 [2025-03-03 10:31:23,694 INFO L226 Difference]: Without dead ends: 699 [2025-03-03 10:31:23,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:23,695 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:23,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-03 10:31:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-03 10:31:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2951289398280803) internal successors, (904), 698 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 904 transitions. [2025-03-03 10:31:23,705 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 904 transitions. Word has length 138 [2025-03-03 10:31:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:23,705 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 904 transitions. [2025-03-03 10:31:23,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 904 transitions. [2025-03-03 10:31:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 10:31:23,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:23,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:31:23,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 391164293, now seen corresponding path program 1 times [2025-03-03 10:31:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919340041] [2025-03-03 10:31:23,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:23,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 10:31:23,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 10:31:23,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:23,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919340041] [2025-03-03 10:31:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919340041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:31:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880775381] [2025-03-03 10:31:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:23,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:23,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:23,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:23,834 INFO L87 Difference]: Start difference. First operand 699 states and 904 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:24,215 INFO L93 Difference]: Finished difference Result 1674 states and 2235 transitions. [2025-03-03 10:31:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 142 [2025-03-03 10:31:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:24,218 INFO L225 Difference]: With dead ends: 1674 [2025-03-03 10:31:24,218 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:31:24,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:24,221 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:24,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 75 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:31:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-03 10:31:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2274590163934427) internal successors, (1198), 976 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1198 transitions. [2025-03-03 10:31:24,238 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1198 transitions. Word has length 142 [2025-03-03 10:31:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:24,238 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1198 transitions. [2025-03-03 10:31:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1198 transitions. [2025-03-03 10:31:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 10:31:24,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:24,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:24,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:31:24,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2043578942, now seen corresponding path program 1 times [2025-03-03 10:31:24,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:24,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720976246] [2025-03-03 10:31:24,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:24,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:24,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 10:31:24,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 10:31:24,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:24,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:24,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:24,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720976246] [2025-03-03 10:31:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720976246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116834313] [2025-03-03 10:31:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:24,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:24,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:24,515 INFO L87 Difference]: Start difference. First operand 977 states and 1198 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:24,928 INFO L93 Difference]: Finished difference Result 1813 states and 2245 transitions. [2025-03-03 10:31:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2025-03-03 10:31:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:24,931 INFO L225 Difference]: With dead ends: 1813 [2025-03-03 10:31:24,931 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:31:24,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:31:24,933 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:24,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:31:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-03 10:31:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2223360655737705) internal successors, (1193), 976 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1193 transitions. [2025-03-03 10:31:24,947 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1193 transitions. Word has length 152 [2025-03-03 10:31:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:24,948 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1193 transitions. [2025-03-03 10:31:24,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1193 transitions. [2025-03-03 10:31:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 10:31:24,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:24,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:24,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:31:24,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:24,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1233361471, now seen corresponding path program 1 times [2025-03-03 10:31:24,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:24,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514768182] [2025-03-03 10:31:24,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:24,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:24,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 10:31:24,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 10:31:24,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 10:31:25,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514768182] [2025-03-03 10:31:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514768182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:25,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:31:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802364926] [2025-03-03 10:31:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:31:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:25,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:31:25,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:25,333 INFO L87 Difference]: Start difference. First operand 977 states and 1193 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:25,702 INFO L93 Difference]: Finished difference Result 1868 states and 2295 transitions. [2025-03-03 10:31:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:31:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 6 states have internal predecessors, (206), 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 213 [2025-03-03 10:31:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:25,705 INFO L225 Difference]: With dead ends: 1868 [2025-03-03 10:31:25,705 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:31:25,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:25,706 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:25,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:31:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-03 10:31:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2172131147540983) internal successors, (1188), 976 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1188 transitions. [2025-03-03 10:31:25,724 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1188 transitions. Word has length 213 [2025-03-03 10:31:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:25,724 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1188 transitions. [2025-03-03 10:31:25,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1188 transitions. [2025-03-03 10:31:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 10:31:25,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:25,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:25,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:31:25,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:25,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash -861127784, now seen corresponding path program 1 times [2025-03-03 10:31:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497610567] [2025-03-03 10:31:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 10:31:25,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 10:31:25,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497610567] [2025-03-03 10:31:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497610567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109181061] [2025-03-03 10:31:26,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:26,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:26,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:26,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:31:26,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:31:26,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 10:31:26,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 10:31:26,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:31:26,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:26,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:31:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109181061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:31:26,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:31:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-03 10:31:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765471361] [2025-03-03 10:31:26,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:31:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:31:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:26,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:31:26,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:31:26,628 INFO L87 Difference]: Start difference. First operand 977 states and 1188 transitions. Second operand has 9 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:29,082 INFO L93 Difference]: Finished difference Result 4037 states and 5289 transitions. [2025-03-03 10:31:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:31:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 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 213 [2025-03-03 10:31:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:29,092 INFO L225 Difference]: With dead ends: 4037 [2025-03-03 10:31:29,092 INFO L226 Difference]: Without dead ends: 3201 [2025-03-03 10:31:29,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:31:29,093 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 939 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 2825 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 2825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:29,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 60 Invalid, 3444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 2825 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:31:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-03-03 10:31:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2089. [2025-03-03 10:31:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.2634099616858236) internal successors, (2638), 2088 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2638 transitions. [2025-03-03 10:31:29,130 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2638 transitions. Word has length 213 [2025-03-03 10:31:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:29,130 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2638 transitions. [2025-03-03 10:31:29,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2638 transitions. [2025-03-03 10:31:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 10:31:29,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:29,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:29,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:31:29,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:29,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:29,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash 561315360, now seen corresponding path program 1 times [2025-03-03 10:31:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186331474] [2025-03-03 10:31:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 10:31:29,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 10:31:29,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:29,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:31:29,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186331474] [2025-03-03 10:31:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186331474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:29,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77245743] [2025-03-03 10:31:29,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:29,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:29,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:29,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:29,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:29,478 INFO L87 Difference]: Start difference. First operand 2089 states and 2638 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:29,857 INFO L93 Difference]: Finished difference Result 4037 states and 5131 transitions. [2025-03-03 10:31:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 259 [2025-03-03 10:31:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:29,867 INFO L225 Difference]: With dead ends: 4037 [2025-03-03 10:31:29,867 INFO L226 Difference]: Without dead ends: 2089 [2025-03-03 10:31:29,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:29,869 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 77 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:29,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 225 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-03 10:31:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2025-03-03 10:31:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1992337164750957) internal successors, (2504), 2088 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2504 transitions. [2025-03-03 10:31:29,896 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2504 transitions. Word has length 259 [2025-03-03 10:31:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:29,896 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2504 transitions. [2025-03-03 10:31:29,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2504 transitions. [2025-03-03 10:31:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 10:31:29,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:29,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:29,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:31:29,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:29,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash -723285957, now seen corresponding path program 1 times [2025-03-03 10:31:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235404894] [2025-03-03 10:31:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:29,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 10:31:29,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 10:31:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 125 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:31:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235404894] [2025-03-03 10:31:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235404894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:31:30,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442463192] [2025-03-03 10:31:30,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:31:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:31:30,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:31:30,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:31:30,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 10:31:30,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 10:31:30,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:30,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:30,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:31:30,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:31:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 10:31:30,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:31:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442463192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:30,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:31:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 10:31:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956397932] [2025-03-03 10:31:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:30,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:30,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:30,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:30,514 INFO L87 Difference]: Start difference. First operand 2089 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:30,840 INFO L93 Difference]: Finished difference Result 4732 states and 5731 transitions. [2025-03-03 10:31:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 266 [2025-03-03 10:31:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:30,848 INFO L225 Difference]: With dead ends: 4732 [2025-03-03 10:31:30,848 INFO L226 Difference]: Without dead ends: 2784 [2025-03-03 10:31:30,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:30,853 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:30,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-03-03 10:31:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2025-03-03 10:31:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2783 states have (on average 1.1595400646784046) internal successors, (3227), 2783 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3227 transitions. [2025-03-03 10:31:30,891 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3227 transitions. Word has length 266 [2025-03-03 10:31:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:30,891 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 3227 transitions. [2025-03-03 10:31:30,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3227 transitions. [2025-03-03 10:31:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 10:31:30,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:30,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:30,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:31:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 10:31:31,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:31,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:31,099 INFO L85 PathProgramCache]: Analyzing trace with hash -987206022, now seen corresponding path program 1 times [2025-03-03 10:31:31,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:31,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190806833] [2025-03-03 10:31:31,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:31,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 10:31:31,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 10:31:31,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:31,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 10:31:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190806833] [2025-03-03 10:31:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190806833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715723872] [2025-03-03 10:31:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:31,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:31,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:31,301 INFO L87 Difference]: Start difference. First operand 2784 states and 3227 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:31,649 INFO L93 Difference]: Finished difference Result 5427 states and 6309 transitions. [2025-03-03 10:31:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 275 [2025-03-03 10:31:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:31,656 INFO L225 Difference]: With dead ends: 5427 [2025-03-03 10:31:31,656 INFO L226 Difference]: Without dead ends: 2784 [2025-03-03 10:31:31,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:31,659 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 83 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:31,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 200 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-03-03 10:31:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2506. [2025-03-03 10:31:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1261477045908184) internal successors, (2821), 2505 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2821 transitions. [2025-03-03 10:31:31,689 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2821 transitions. Word has length 275 [2025-03-03 10:31:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2821 transitions. [2025-03-03 10:31:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2821 transitions. [2025-03-03 10:31:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-03 10:31:31,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:31,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:31,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:31:31,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:31,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash -520231241, now seen corresponding path program 1 times [2025-03-03 10:31:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370665720] [2025-03-03 10:31:31,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:31,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-03 10:31:31,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-03 10:31:31,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:31,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:31:31,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:31,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370665720] [2025-03-03 10:31:31,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370665720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:31,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748023775] [2025-03-03 10:31:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:31,841 INFO L87 Difference]: Start difference. First operand 2506 states and 2821 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:32,190 INFO L93 Difference]: Finished difference Result 4732 states and 5353 transitions. [2025-03-03 10:31:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 281 [2025-03-03 10:31:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:32,197 INFO L225 Difference]: With dead ends: 4732 [2025-03-03 10:31:32,197 INFO L226 Difference]: Without dead ends: 2367 [2025-03-03 10:31:32,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:32,199 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 78 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 215 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-03-03 10:31:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2025-03-03 10:31:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2366 states have (on average 1.095942519019442) internal successors, (2593), 2366 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2593 transitions. [2025-03-03 10:31:32,227 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2593 transitions. Word has length 281 [2025-03-03 10:31:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:32,227 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 2593 transitions. [2025-03-03 10:31:32,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2593 transitions. [2025-03-03 10:31:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 10:31:32,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:32,232 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:32,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:31:32,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:32,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash 885828260, now seen corresponding path program 1 times [2025-03-03 10:31:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134688850] [2025-03-03 10:31:32,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:32,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:31:32,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:31:32,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:32,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:31:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:32,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134688850] [2025-03-03 10:31:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134688850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:32,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:32,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:31:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485044974] [2025-03-03 10:31:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:31:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:32,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:31:32,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:31:32,517 INFO L87 Difference]: Start difference. First operand 2367 states and 2593 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:33,046 INFO L93 Difference]: Finished difference Result 5010 states and 5483 transitions. [2025-03-03 10:31:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:31:33,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 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 363 [2025-03-03 10:31:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:33,053 INFO L225 Difference]: With dead ends: 5010 [2025-03-03 10:31:33,053 INFO L226 Difference]: Without dead ends: 2784 [2025-03-03 10:31:33,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03-03 10:31:33,055 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 155 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:33,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 17 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:31:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-03-03 10:31:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2228. [2025-03-03 10:31:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.0951953300404131) internal successors, (2439), 2227 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2439 transitions. [2025-03-03 10:31:33,082 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2439 transitions. Word has length 363 [2025-03-03 10:31:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2439 transitions. [2025-03-03 10:31:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2439 transitions. [2025-03-03 10:31:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 10:31:33,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:33,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:31:33,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1520518595, now seen corresponding path program 1 times [2025-03-03 10:31:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660090649] [2025-03-03 10:31:33,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:33,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 10:31:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 10:31:33,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:33,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-03 10:31:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:33,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660090649] [2025-03-03 10:31:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660090649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:31:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507468592] [2025-03-03 10:31:33,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:33,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:31:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:33,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:31:33,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:33,241 INFO L87 Difference]: Start difference. First operand 2228 states and 2439 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:33,563 INFO L93 Difference]: Finished difference Result 4315 states and 4733 transitions. [2025-03-03 10:31:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:31:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 373 [2025-03-03 10:31:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:33,569 INFO L225 Difference]: With dead ends: 4315 [2025-03-03 10:31:33,570 INFO L226 Difference]: Without dead ends: 2228 [2025-03-03 10:31:33,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:31:33,573 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:33,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 190 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:31:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-03 10:31:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2089. [2025-03-03 10:31:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.0756704980842913) internal successors, (2246), 2088 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2246 transitions. [2025-03-03 10:31:33,602 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2246 transitions. Word has length 373 [2025-03-03 10:31:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2246 transitions. [2025-03-03 10:31:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2246 transitions. [2025-03-03 10:31:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-03 10:31:33,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:31:33,609 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:33,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:31:33,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:31:33,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:31:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash -926656948, now seen corresponding path program 1 times [2025-03-03 10:31:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:31:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454400820] [2025-03-03 10:31:33,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:31:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:31:33,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 10:31:33,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 10:31:33,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:31:33,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:31:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-03 10:31:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:31:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454400820] [2025-03-03 10:31:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454400820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:31:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:31:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:31:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798718500] [2025-03-03 10:31:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:31:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:31:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:31:33,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:31:33,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:33,938 INFO L87 Difference]: Start difference. First operand 2089 states and 2246 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:31:34,332 INFO L93 Difference]: Finished difference Result 3953 states and 4254 transitions. [2025-03-03 10:31:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:31:34,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 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 379 [2025-03-03 10:31:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:31:34,333 INFO L225 Difference]: With dead ends: 3953 [2025-03-03 10:31:34,333 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:31:34,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:31:34,336 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:31:34,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 22 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:31:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:31:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:31:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:31:34,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 379 [2025-03-03 10:31:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:31:34,337 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:31:34,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:31:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:31:34,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:31:34,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:31:34,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:31:34,344 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:31:34,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:31:34,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:31:34,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:31:34 BoogieIcfgContainer [2025-03-03 10:31:34,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:31:34,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:31:34,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:31:34,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:31:34,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:31:21" (3/4) ... [2025-03-03 10:31:34,532 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:31:34,547 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:31:34,548 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:31:34,548 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:31:34,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:31:34,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:31:34,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:31:34,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:31:34,641 INFO L158 Benchmark]: Toolchain (without parser) took 14856.67ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 120.7MB in the beginning and 207.0MB in the end (delta: -86.3MB). Peak memory consumption was 163.0MB. Max. memory is 16.1GB. [2025-03-03 10:31:34,641 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:31:34,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.17ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 92.0MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:31:34,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.92ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 85.3MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:31:34,644 INFO L158 Benchmark]: Boogie Preprocessor took 87.10ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 76.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:31:34,644 INFO L158 Benchmark]: IcfgBuilder took 963.62ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 68.1MB in the end (delta: 8.3MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-03-03 10:31:34,644 INFO L158 Benchmark]: TraceAbstraction took 13312.96ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 67.2MB in the beginning and 219.3MB in the end (delta: -152.0MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2025-03-03 10:31:34,644 INFO L158 Benchmark]: Witness Printer took 111.03ms. Allocated memory is still 419.4MB. Free memory was 219.3MB in the beginning and 207.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:31:34,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.17ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 92.0MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.92ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 85.3MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.10ms. Allocated memory is still 167.8MB. Free memory was 85.3MB in the beginning and 76.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 963.62ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 68.1MB in the end (delta: 8.3MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13312.96ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 67.2MB in the beginning and 219.3MB in the end (delta: -152.0MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. * Witness Printer took 111.03ms. Allocated memory is still 419.4MB. Free memory was 219.3MB in the beginning and 207.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 209]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2195 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2195 mSDsluCounter, 1456 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 1272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8685 IncrementalHoareTripleChecker+Invalid, 9957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1272 mSolverCounterUnsat, 1321 mSDtfsCounter, 8685 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2784occurred in iteration=9, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2085 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3729 NumberOfCodeBlocks, 3729 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3925 ConstructedInterpolants, 0 QuantifiedInterpolants, 13933 SizeOfPredicates, 1 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 3157/3437 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: ((((((((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1))) || (((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1)))) || (((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1))) && (10 <= a19))) || (((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1)))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (a19 == 6)) && (0 <= ((long long) 600000 + a1)))) || ((((0 <= ((long long) a1 + 12)) && (a10 <= 0)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:31:34,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE