./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label09.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 759500fc885fd8551afb1744440c02e812929b084934756d49ccfd6e6b033437 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:54:39,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:54:39,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:54:39,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:54:39,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:54:39,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:54:39,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:54:39,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:54:39,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:54:39,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:54:39,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:54:39,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:54:39,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:54:39,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:54:39,360 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:54:39,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:54:39,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:54:39,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:54:39,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:39,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:39,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:39,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:54:39,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 759500fc885fd8551afb1744440c02e812929b084934756d49ccfd6e6b033437 [2025-01-08 22:54:39,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:54:39,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:54:39,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:54:39,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:54:39,598 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:54:39,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label09.c [2025-01-08 22:54:40,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8775ff779/d583fc41c12b4cab90c43c61db175c0e/FLAGa1ed04554 [2025-01-08 22:54:41,056 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:54:41,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label09.c [2025-01-08 22:54:41,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8775ff779/d583fc41c12b4cab90c43c61db175c0e/FLAGa1ed04554 [2025-01-08 22:54:41,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8775ff779/d583fc41c12b4cab90c43c61db175c0e [2025-01-08 22:54:41,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:54:41,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:54:41,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:41,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:54:41,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:54:41,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:41,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568cdff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41, skipping insertion in model container [2025-01-08 22:54:41,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:41,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:54:41,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label09.c[54191,54204] [2025-01-08 22:54:41,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:41,818 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:54:41,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label09.c[54191,54204] [2025-01-08 22:54:41,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:41,962 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:54:41,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41 WrapperNode [2025-01-08 22:54:41,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:41,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:41,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:54:41,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:54:41,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:41,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,053 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:54:42,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:42,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:54:42,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:54:42,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:54:42,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:54:42,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:54:42,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:54:42,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:54:42,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:54:42,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (1/1) ... [2025-01-08 22:54:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:42,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:42,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:54:42,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:54:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:54:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:54:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:54:42,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:54:42,295 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:54:42,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:54:43,616 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:54:43,616 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:54:43,627 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:54:43,627 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:54:43,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:43 BoogieIcfgContainer [2025-01-08 22:54:43,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:54:43,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:54:43,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:54:43,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:54:43,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:54:41" (1/3) ... [2025-01-08 22:54:43,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19254b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:43, skipping insertion in model container [2025-01-08 22:54:43,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:41" (2/3) ... [2025-01-08 22:54:43,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19254b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:43, skipping insertion in model container [2025-01-08 22:54:43,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:43" (3/3) ... [2025-01-08 22:54:43,634 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label09.c [2025-01-08 22:54:43,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:54:43,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label09.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:54:43,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:54:43,695 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;@14903ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:54:43,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:54:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-08 22:54:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:43,707 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:43,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:43,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1768684366, now seen corresponding path program 1 times [2025-01-08 22:54:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256594249] [2025-01-08 22:54:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:43,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-08 22:54:43,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-08 22:54:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256594249] [2025-01-08 22:54:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256594249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180029342] [2025-01-08 22:54:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:44,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:44,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:44,326 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:45,195 INFO L93 Difference]: Finished difference Result 829 states and 1475 transitions. [2025-01-08 22:54:45,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:45,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 148 [2025-01-08 22:54:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:45,204 INFO L225 Difference]: With dead ends: 829 [2025-01-08 22:54:45,204 INFO L226 Difference]: Without dead ends: 463 [2025-01-08 22:54:45,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:45,208 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:45,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 129 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:54:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-08 22:54:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2025-01-08 22:54:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2025-01-08 22:54:45,249 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 148 [2025-01-08 22:54:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:45,250 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2025-01-08 22:54:45,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2025-01-08 22:54:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-08 22:54:45,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:45,252 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:45,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:54:45,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:45,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1736822269, now seen corresponding path program 1 times [2025-01-08 22:54:45,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989021875] [2025-01-08 22:54:45,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:45,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-08 22:54:45,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-08 22:54:45,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:45,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989021875] [2025-01-08 22:54:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989021875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794380041] [2025-01-08 22:54:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:45,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:45,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:45,537 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:45,769 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2025-01-08 22:54:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 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 153 [2025-01-08 22:54:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:45,777 INFO L225 Difference]: With dead ends: 1341 [2025-01-08 22:54:45,777 INFO L226 Difference]: Without dead ends: 894 [2025-01-08 22:54:45,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:45,779 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:45,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-08 22:54:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 891. [2025-01-08 22:54:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.6191011235955055) internal successors, (1441), 890 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1441 transitions. [2025-01-08 22:54:45,819 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1441 transitions. Word has length 153 [2025-01-08 22:54:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:45,819 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1441 transitions. [2025-01-08 22:54:45,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1441 transitions. [2025-01-08 22:54:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-08 22:54:45,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:45,822 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:45,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:54:45,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:45,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1599220488, now seen corresponding path program 1 times [2025-01-08 22:54:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:45,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433880524] [2025-01-08 22:54:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-08 22:54:45,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-08 22:54:45,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:45,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433880524] [2025-01-08 22:54:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433880524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:54:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248874750] [2025-01-08 22:54:46,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:54:46,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:46,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:54:46,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:54:46,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-08 22:54:46,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-08 22:54:46,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:46,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:46,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:54:46,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:54:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:46,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:54:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248874750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:46,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:54:46,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 22:54:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313429651] [2025-01-08 22:54:46,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:46,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:46,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:46,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:46,382 INFO L87 Difference]: Start difference. First operand 891 states and 1441 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:47,040 INFO L93 Difference]: Finished difference Result 2628 states and 4271 transitions. [2025-01-08 22:54:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 155 [2025-01-08 22:54:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:47,048 INFO L225 Difference]: With dead ends: 2628 [2025-01-08 22:54:47,048 INFO L226 Difference]: Without dead ends: 1739 [2025-01-08 22:54:47,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:47,051 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 122 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:47,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 132 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-01-08 22:54:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1727. [2025-01-08 22:54:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.5330243337195828) internal successors, (2646), 1726 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2646 transitions. [2025-01-08 22:54:47,093 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2646 transitions. Word has length 155 [2025-01-08 22:54:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:47,093 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2646 transitions. [2025-01-08 22:54:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2646 transitions. [2025-01-08 22:54:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 22:54:47,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:47,098 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:47,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:54:47,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:54:47,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:47,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 736018921, now seen corresponding path program 1 times [2025-01-08 22:54:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:47,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252343743] [2025-01-08 22:54:47,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:47,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 22:54:47,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 22:54:47,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:47,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252343743] [2025-01-08 22:54:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252343743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:47,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:47,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688264303] [2025-01-08 22:54:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:47,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:47,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,461 INFO L87 Difference]: Start difference. First operand 1727 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:48,130 INFO L93 Difference]: Finished difference Result 5114 states and 7843 transitions. [2025-01-08 22:54:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:48,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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 161 [2025-01-08 22:54:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:48,141 INFO L225 Difference]: With dead ends: 5114 [2025-01-08 22:54:48,141 INFO L226 Difference]: Without dead ends: 3389 [2025-01-08 22:54:48,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:48,143 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:48,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 148 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2025-01-08 22:54:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3383. [2025-01-08 22:54:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3382 states have (on average 1.4488468361916027) internal successors, (4900), 3382 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 4900 transitions. [2025-01-08 22:54:48,198 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 4900 transitions. Word has length 161 [2025-01-08 22:54:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:48,198 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 4900 transitions. [2025-01-08 22:54:48,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 4900 transitions. [2025-01-08 22:54:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-08 22:54:48,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:48,203 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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-01-08 22:54:48,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:54:48,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1195294206, now seen corresponding path program 1 times [2025-01-08 22:54:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32505365] [2025-01-08 22:54:48,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:48,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-08 22:54:48,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-08 22:54:48,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:48,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:54:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32505365] [2025-01-08 22:54:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32505365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:48,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382110764] [2025-01-08 22:54:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:48,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:48,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:48,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:48,511 INFO L87 Difference]: Start difference. First operand 3383 states and 4900 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:49,267 INFO L93 Difference]: Finished difference Result 8446 states and 12203 transitions. [2025-01-08 22:54:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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 165 [2025-01-08 22:54:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:49,282 INFO L225 Difference]: With dead ends: 8446 [2025-01-08 22:54:49,282 INFO L226 Difference]: Without dead ends: 5065 [2025-01-08 22:54:49,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,287 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 226 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:49,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 179 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:54:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2025-01-08 22:54:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 5043. [2025-01-08 22:54:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5043 states, 5042 states have (on average 1.4325664418881396) internal successors, (7223), 5042 states have internal predecessors, (7223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5043 states to 5043 states and 7223 transitions. [2025-01-08 22:54:49,385 INFO L78 Accepts]: Start accepts. Automaton has 5043 states and 7223 transitions. Word has length 165 [2025-01-08 22:54:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 5043 states and 7223 transitions. [2025-01-08 22:54:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5043 states and 7223 transitions. [2025-01-08 22:54:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-08 22:54:49,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:49,393 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:49,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:54:49,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 517247347, now seen corresponding path program 1 times [2025-01-08 22:54:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880855778] [2025-01-08 22:54:49,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:49,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-08 22:54:49,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-08 22:54:49,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:49,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880855778] [2025-01-08 22:54:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880855778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:49,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483141393] [2025-01-08 22:54:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:49,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:49,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,482 INFO L87 Difference]: Start difference. First operand 5043 states and 7223 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:50,166 INFO L93 Difference]: Finished difference Result 10078 states and 14434 transitions. [2025-01-08 22:54:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 170 [2025-01-08 22:54:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:50,181 INFO L225 Difference]: With dead ends: 10078 [2025-01-08 22:54:50,181 INFO L226 Difference]: Without dead ends: 5037 [2025-01-08 22:54:50,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:50,187 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 269 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:50,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 376 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5037 states. [2025-01-08 22:54:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5037 to 5033. [2025-01-08 22:54:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5033 states, 5032 states have (on average 1.3396263910969792) internal successors, (6741), 5032 states have internal predecessors, (6741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5033 states to 5033 states and 6741 transitions. [2025-01-08 22:54:50,257 INFO L78 Accepts]: Start accepts. Automaton has 5033 states and 6741 transitions. Word has length 170 [2025-01-08 22:54:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:50,257 INFO L471 AbstractCegarLoop]: Abstraction has 5033 states and 6741 transitions. [2025-01-08 22:54:50,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5033 states and 6741 transitions. [2025-01-08 22:54:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-08 22:54:50,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:50,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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, 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-01-08 22:54:50,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:54:50,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:50,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -639450504, now seen corresponding path program 2 times [2025-01-08 22:54:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777618830] [2025-01-08 22:54:50,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:54:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:50,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-01-08 22:54:50,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-01-08 22:54:50,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:54:50,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:54:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777618830] [2025-01-08 22:54:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777618830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:50,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:50,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:50,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755529427] [2025-01-08 22:54:50,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:50,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:50,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:50,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:50,492 INFO L87 Difference]: Start difference. First operand 5033 states and 6741 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:51,169 INFO L93 Difference]: Finished difference Result 14982 states and 20073 transitions. [2025-01-08 22:54:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:51,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 172 [2025-01-08 22:54:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:51,194 INFO L225 Difference]: With dead ends: 14982 [2025-01-08 22:54:51,194 INFO L226 Difference]: Without dead ends: 9951 [2025-01-08 22:54:51,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:51,202 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 115 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:51,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 177 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2025-01-08 22:54:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 9949. [2025-01-08 22:54:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9949 states, 9948 states have (on average 1.2925211097708083) internal successors, (12858), 9948 states have internal predecessors, (12858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9949 states to 9949 states and 12858 transitions. [2025-01-08 22:54:51,382 INFO L78 Accepts]: Start accepts. Automaton has 9949 states and 12858 transitions. Word has length 172 [2025-01-08 22:54:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:51,383 INFO L471 AbstractCegarLoop]: Abstraction has 9949 states and 12858 transitions. [2025-01-08 22:54:51,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9949 states and 12858 transitions. [2025-01-08 22:54:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-08 22:54:51,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:51,393 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:51,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:54:51,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1940321828, now seen corresponding path program 1 times [2025-01-08 22:54:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273417765] [2025-01-08 22:54:51,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:51,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 22:54:51,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 22:54:51,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:51,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:54:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:51,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273417765] [2025-01-08 22:54:51,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273417765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:51,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:51,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:51,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292448166] [2025-01-08 22:54:51,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:51,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:51,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:51,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:51,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:51,495 INFO L87 Difference]: Start difference. First operand 9949 states and 12858 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:51,860 INFO L93 Difference]: Finished difference Result 19611 states and 25355 transitions. [2025-01-08 22:54:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 176 [2025-01-08 22:54:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:51,877 INFO L225 Difference]: With dead ends: 19611 [2025-01-08 22:54:51,877 INFO L226 Difference]: Without dead ends: 9664 [2025-01-08 22:54:51,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:51,887 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:51,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-01-08 22:54:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 9664. [2025-01-08 22:54:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9664 states, 9663 states have (on average 1.2699989651247026) internal successors, (12272), 9663 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9664 states to 9664 states and 12272 transitions. [2025-01-08 22:54:52,087 INFO L78 Accepts]: Start accepts. Automaton has 9664 states and 12272 transitions. Word has length 176 [2025-01-08 22:54:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:52,087 INFO L471 AbstractCegarLoop]: Abstraction has 9664 states and 12272 transitions. [2025-01-08 22:54:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9664 states and 12272 transitions. [2025-01-08 22:54:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-08 22:54:52,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:52,098 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:52,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:54:52,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:52,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1357748793, now seen corresponding path program 1 times [2025-01-08 22:54:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:52,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111391873] [2025-01-08 22:54:52,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:52,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-08 22:54:52,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-08 22:54:52,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:52,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:52,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:52,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111391873] [2025-01-08 22:54:52,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111391873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:52,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:52,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:52,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522309049] [2025-01-08 22:54:52,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:52,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:52,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:52,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:52,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:52,212 INFO L87 Difference]: Start difference. First operand 9664 states and 12272 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:52,524 INFO L93 Difference]: Finished difference Result 28110 states and 35686 transitions. [2025-01-08 22:54:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-01-08 22:54:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:52,555 INFO L225 Difference]: With dead ends: 28110 [2025-01-08 22:54:52,555 INFO L226 Difference]: Without dead ends: 18651 [2025-01-08 22:54:52,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:52,568 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:52,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18651 states. [2025-01-08 22:54:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18651 to 18649. [2025-01-08 22:54:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18649 states, 18648 states have (on average 1.2675353925353925) internal successors, (23637), 18648 states have internal predecessors, (23637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18649 states to 18649 states and 23637 transitions. [2025-01-08 22:54:52,829 INFO L78 Accepts]: Start accepts. Automaton has 18649 states and 23637 transitions. Word has length 177 [2025-01-08 22:54:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:52,829 INFO L471 AbstractCegarLoop]: Abstraction has 18649 states and 23637 transitions. [2025-01-08 22:54:52,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 18649 states and 23637 transitions. [2025-01-08 22:54:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-08 22:54:52,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:52,844 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:52,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:54:52,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash 576463531, now seen corresponding path program 1 times [2025-01-08 22:54:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506371551] [2025-01-08 22:54:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:52,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-08 22:54:52,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-08 22:54:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:52,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:54:52,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:52,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506371551] [2025-01-08 22:54:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506371551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:52,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:52,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413267301] [2025-01-08 22:54:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:52,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:52,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:52,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:52,995 INFO L87 Difference]: Start difference. First operand 18649 states and 23637 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:53,842 INFO L93 Difference]: Finished difference Result 51106 states and 64874 transitions. [2025-01-08 22:54:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:53,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 185 [2025-01-08 22:54:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:53,891 INFO L225 Difference]: With dead ends: 51106 [2025-01-08 22:54:53,891 INFO L226 Difference]: Without dead ends: 32662 [2025-01-08 22:54:53,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:53,913 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 203 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:53,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 375 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:54:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32662 states. [2025-01-08 22:54:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32662 to 31432. [2025-01-08 22:54:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31432 states, 31431 states have (on average 1.1797270210938247) internal successors, (37080), 31431 states have internal predecessors, (37080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31432 states to 31432 states and 37080 transitions. [2025-01-08 22:54:54,331 INFO L78 Accepts]: Start accepts. Automaton has 31432 states and 37080 transitions. Word has length 185 [2025-01-08 22:54:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:54,331 INFO L471 AbstractCegarLoop]: Abstraction has 31432 states and 37080 transitions. [2025-01-08 22:54:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 31432 states and 37080 transitions. [2025-01-08 22:54:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-08 22:54:54,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:54,354 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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, 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-01-08 22:54:54,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:54:54,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:54,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1992259632, now seen corresponding path program 1 times [2025-01-08 22:54:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963241701] [2025-01-08 22:54:54,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-08 22:54:54,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-08 22:54:54,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:54,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-08 22:54:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963241701] [2025-01-08 22:54:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963241701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:54,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519757164] [2025-01-08 22:54:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:54,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:54,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:54,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:54,709 INFO L87 Difference]: Start difference. First operand 31432 states and 37080 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:55,638 INFO L93 Difference]: Finished difference Result 73470 states and 86599 transitions. [2025-01-08 22:54:55,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:55,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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 211 [2025-01-08 22:54:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:55,713 INFO L225 Difference]: With dead ends: 73470 [2025-01-08 22:54:55,714 INFO L226 Difference]: Without dead ends: 42446 [2025-01-08 22:54:55,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:55,743 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 191 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:55,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 125 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:54:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42446 states. [2025-01-08 22:54:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42446 to 39805. [2025-01-08 22:54:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39805 states, 39804 states have (on average 1.1726962114360366) internal successors, (46678), 39804 states have internal predecessors, (46678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39805 states to 39805 states and 46678 transitions. [2025-01-08 22:54:56,380 INFO L78 Accepts]: Start accepts. Automaton has 39805 states and 46678 transitions. Word has length 211 [2025-01-08 22:54:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:56,380 INFO L471 AbstractCegarLoop]: Abstraction has 39805 states and 46678 transitions. [2025-01-08 22:54:56,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 39805 states and 46678 transitions. [2025-01-08 22:54:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-08 22:54:56,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:56,402 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 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, 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-01-08 22:54:56,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:54:56,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 28559050, now seen corresponding path program 2 times [2025-01-08 22:54:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292942170] [2025-01-08 22:54:56,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:54:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:56,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-01-08 22:54:56,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-01-08 22:54:56,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:54:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:54:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292942170] [2025-01-08 22:54:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292942170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:56,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785191671] [2025-01-08 22:54:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:56,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:56,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:56,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:56,605 INFO L87 Difference]: Start difference. First operand 39805 states and 46678 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:57,482 INFO L93 Difference]: Finished difference Result 100314 states and 119254 transitions. [2025-01-08 22:54:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:57,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 218 [2025-01-08 22:54:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:57,568 INFO L225 Difference]: With dead ends: 100314 [2025-01-08 22:54:57,568 INFO L226 Difference]: Without dead ends: 60511 [2025-01-08 22:54:57,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:57,597 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:57,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 151 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60511 states. [2025-01-08 22:54:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60511 to 58075. [2025-01-08 22:54:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58075 states, 58074 states have (on average 1.1393566828529118) internal successors, (66167), 58074 states have internal predecessors, (66167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58075 states to 58075 states and 66167 transitions. [2025-01-08 22:54:58,358 INFO L78 Accepts]: Start accepts. Automaton has 58075 states and 66167 transitions. Word has length 218 [2025-01-08 22:54:58,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:58,358 INFO L471 AbstractCegarLoop]: Abstraction has 58075 states and 66167 transitions. [2025-01-08 22:54:58,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 58075 states and 66167 transitions. [2025-01-08 22:54:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-08 22:54:58,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:58,378 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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, 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-01-08 22:54:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:54:58,378 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:58,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash -112526476, now seen corresponding path program 1 times [2025-01-08 22:54:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652993849] [2025-01-08 22:54:58,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:58,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-08 22:54:58,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-08 22:54:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:58,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:58,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652993849] [2025-01-08 22:54:58,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652993849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:58,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090102562] [2025-01-08 22:54:58,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:58,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:54:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:58,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:54:58,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:54:58,716 INFO L87 Difference]: Start difference. First operand 58075 states and 66167 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:59,849 INFO L93 Difference]: Finished difference Result 168103 states and 191969 transitions. [2025-01-08 22:54:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:54:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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 248 [2025-01-08 22:54:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:00,012 INFO L225 Difference]: With dead ends: 168103 [2025-01-08 22:55:00,012 INFO L226 Difference]: Without dead ends: 110233 [2025-01-08 22:55:00,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:00,073 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 820 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:00,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 51 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110233 states. [2025-01-08 22:55:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110233 to 110219. [2025-01-08 22:55:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110219 states, 110218 states have (on average 1.1424903373314703) internal successors, (125923), 110218 states have internal predecessors, (125923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110219 states to 110219 states and 125923 transitions. [2025-01-08 22:55:01,560 INFO L78 Accepts]: Start accepts. Automaton has 110219 states and 125923 transitions. Word has length 248 [2025-01-08 22:55:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:01,561 INFO L471 AbstractCegarLoop]: Abstraction has 110219 states and 125923 transitions. [2025-01-08 22:55:01,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 110219 states and 125923 transitions. [2025-01-08 22:55:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-08 22:55:01,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:01,599 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:01,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:55:01,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:01,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -207245324, now seen corresponding path program 1 times [2025-01-08 22:55:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569347427] [2025-01-08 22:55:01,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:01,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:01,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 22:55:01,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 22:55:01,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:01,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-08 22:55:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569347427] [2025-01-08 22:55:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569347427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239312738] [2025-01-08 22:55:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:01,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:01,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:01,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:01,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:01,826 INFO L87 Difference]: Start difference. First operand 110219 states and 125923 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:03,342 INFO L93 Difference]: Finished difference Result 298379 states and 340390 transitions. [2025-01-08 22:55:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 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 287 [2025-01-08 22:55:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:03,576 INFO L225 Difference]: With dead ends: 298379 [2025-01-08 22:55:03,577 INFO L226 Difference]: Without dead ends: 188365 [2025-01-08 22:55:03,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:03,636 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:03,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 148 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188365 states. [2025-01-08 22:55:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188365 to 146572. [2025-01-08 22:55:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146572 states, 146571 states have (on average 1.1459770350205702) internal successors, (167967), 146571 states have internal predecessors, (167967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146572 states to 146572 states and 167967 transitions. [2025-01-08 22:55:06,175 INFO L78 Accepts]: Start accepts. Automaton has 146572 states and 167967 transitions. Word has length 287 [2025-01-08 22:55:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:06,175 INFO L471 AbstractCegarLoop]: Abstraction has 146572 states and 167967 transitions. [2025-01-08 22:55:06,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 146572 states and 167967 transitions. [2025-01-08 22:55:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-08 22:55:06,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:06,208 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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-01-08 22:55:06,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:55:06,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:06,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 617210793, now seen corresponding path program 1 times [2025-01-08 22:55:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:06,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591773225] [2025-01-08 22:55:06,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:06,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-08 22:55:06,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-08 22:55:06,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:06,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-08 22:55:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591773225] [2025-01-08 22:55:06,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591773225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:06,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918984233] [2025-01-08 22:55:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:06,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:06,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:06,810 INFO L87 Difference]: Start difference. First operand 146572 states and 167967 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:08,499 INFO L93 Difference]: Finished difference Result 317580 states and 363538 transitions. [2025-01-08 22:55:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 3 states have internal predecessors, (251), 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 308 [2025-01-08 22:55:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:08,713 INFO L225 Difference]: With dead ends: 317580 [2025-01-08 22:55:08,713 INFO L226 Difference]: Without dead ends: 171010 [2025-01-08 22:55:08,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:08,818 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 365 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:08,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 79 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:55:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171010 states. [2025-01-08 22:55:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171010 to 164046. [2025-01-08 22:55:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164046 states, 164045 states have (on average 1.1391325550915907) internal successors, (186869), 164045 states have internal predecessors, (186869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164046 states to 164046 states and 186869 transitions. [2025-01-08 22:55:10,992 INFO L78 Accepts]: Start accepts. Automaton has 164046 states and 186869 transitions. Word has length 308 [2025-01-08 22:55:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:10,992 INFO L471 AbstractCegarLoop]: Abstraction has 164046 states and 186869 transitions. [2025-01-08 22:55:10,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 164046 states and 186869 transitions. [2025-01-08 22:55:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-08 22:55:11,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:11,022 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-01-08 22:55:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:55:11,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:11,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2056425719, now seen corresponding path program 1 times [2025-01-08 22:55:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577858862] [2025-01-08 22:55:11,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:11,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 22:55:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 22:55:11,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:11,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-01-08 22:55:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577858862] [2025-01-08 22:55:11,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577858862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:11,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906533041] [2025-01-08 22:55:11,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:11,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:11,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:11,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:11,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:55:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 22:55:11,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 22:55:11,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:11,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:11,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:55:11,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-08 22:55:11,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906533041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:11,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:11,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 22:55:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098920998] [2025-01-08 22:55:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:11,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:11,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:11,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:11,984 INFO L87 Difference]: Start difference. First operand 164046 states and 186869 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:12,986 INFO L93 Difference]: Finished difference Result 328082 states and 373728 transitions. [2025-01-08 22:55:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:12,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 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 320 [2025-01-08 22:55:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:13,200 INFO L225 Difference]: With dead ends: 328082 [2025-01-08 22:55:13,200 INFO L226 Difference]: Without dead ends: 164038 [2025-01-08 22:55:13,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:13,313 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 275 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:13,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 29 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:55:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164038 states. [2025-01-08 22:55:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164038 to 164038. [2025-01-08 22:55:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164038 states, 164037 states have (on average 1.1390905710297068) internal successors, (186853), 164037 states have internal predecessors, (186853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164038 states to 164038 states and 186853 transitions. [2025-01-08 22:55:15,668 INFO L78 Accepts]: Start accepts. Automaton has 164038 states and 186853 transitions. Word has length 320 [2025-01-08 22:55:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 164038 states and 186853 transitions. [2025-01-08 22:55:15,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 164038 states and 186853 transitions. [2025-01-08 22:55:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-08 22:55:15,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:15,708 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-01-08 22:55:15,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:55:15,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:55:15,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:15,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -733829867, now seen corresponding path program 1 times [2025-01-08 22:55:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705199601] [2025-01-08 22:55:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:15,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 22:55:15,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 22:55:15,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-08 22:55:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705199601] [2025-01-08 22:55:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705199601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082416619] [2025-01-08 22:55:16,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:16,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:55:16,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 22:55:16,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 22:55:16,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:16,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:16,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:55:16,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-08 22:55:16,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082416619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209177646] [2025-01-08 22:55:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:16,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:16,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:16,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:16,619 INFO L87 Difference]: Start difference. First operand 164038 states and 186853 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:17,907 INFO L93 Difference]: Finished difference Result 467425 states and 532999 transitions. [2025-01-08 22:55:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:17,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 329 [2025-01-08 22:55:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:18,350 INFO L225 Difference]: With dead ends: 467425 [2025-01-08 22:55:18,350 INFO L226 Difference]: Without dead ends: 303389 [2025-01-08 22:55:18,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:18,440 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 287 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:18,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 862 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:55:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303389 states. [2025-01-08 22:55:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303389 to 300537. [2025-01-08 22:55:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300537 states, 300536 states have (on average 1.129282348870019) internal successors, (339390), 300536 states have internal predecessors, (339390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300537 states to 300537 states and 339390 transitions. [2025-01-08 22:55:22,988 INFO L78 Accepts]: Start accepts. Automaton has 300537 states and 339390 transitions. Word has length 329 [2025-01-08 22:55:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 300537 states and 339390 transitions. [2025-01-08 22:55:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 300537 states and 339390 transitions. [2025-01-08 22:55:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-08 22:55:23,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:23,041 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-01-08 22:55:23,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:55:23,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:23,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:23,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 348594769, now seen corresponding path program 1 times [2025-01-08 22:55:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:23,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233174292] [2025-01-08 22:55:23,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:23,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-08 22:55:23,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-08 22:55:23,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:23,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-08 22:55:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233174292] [2025-01-08 22:55:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233174292] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141884738] [2025-01-08 22:55:23,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:23,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:23,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:23,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:23,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:55:23,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-08 22:55:23,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-08 22:55:23,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:23,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:55:23,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 22:55:23,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141884738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325893140] [2025-01-08 22:55:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:23,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:23,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:23,917 INFO L87 Difference]: Start difference. First operand 300537 states and 339390 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:26,034 INFO L93 Difference]: Finished difference Result 557576 states and 629669 transitions. [2025-01-08 22:55:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 335 [2025-01-08 22:55:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:26,406 INFO L225 Difference]: With dead ends: 557576 [2025-01-08 22:55:26,407 INFO L226 Difference]: Without dead ends: 257041 [2025-01-08 22:55:26,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:26,552 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 251 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:26,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 327 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257041 states.