./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label49.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efd9f0184b4cf1cfcb5f9b1d78709aac2b2266fe0e62322fe4e22ac75e57a068 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:01:58,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:01:58,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:01:58,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:01:58,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:01:58,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:01:58,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:01:58,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:01:58,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:01:58,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:01:58,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:01:58,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:01:58,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:01:58,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:01:58,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:01:58,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:01:58,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:01:58,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:01:58,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:01:58,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:01:58,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efd9f0184b4cf1cfcb5f9b1d78709aac2b2266fe0e62322fe4e22ac75e57a068 [2025-03-03 11:01:58,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:01:58,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:01:58,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:01:58,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:01:58,435 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:01:58,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label49.c [2025-03-03 11:01:59,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c6f831d/030a48231a4147f5baf884de9d9513cc/FLAG08a2eee9a [2025-03-03 11:02:00,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:02:00,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label49.c [2025-03-03 11:02:00,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c6f831d/030a48231a4147f5baf884de9d9513cc/FLAG08a2eee9a [2025-03-03 11:02:00,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c6f831d/030a48231a4147f5baf884de9d9513cc [2025-03-03 11:02:00,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:02:00,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:02:00,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:00,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:02:00,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:02:00,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4259f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00, skipping insertion in model container [2025-03-03 11:02:00,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:02:00,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label49.c[2362,2375] [2025-03-03 11:02:00,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:00,761 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:02:00,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label49.c[2362,2375] [2025-03-03 11:02:00,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:00,931 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:02:00,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00 WrapperNode [2025-03-03 11:02:00,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:00,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:00,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:02:00,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:02:00,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:00,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,156 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:02:01,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:01,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:02:01,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:02:01,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:02:01,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:02:01,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:02:01,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:02:01,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:02:01,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:02:01,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (1/1) ... [2025-03-03 11:02:01,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:02:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:01,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:02:01,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:02:01,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:02:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:02:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:02:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:02:01,683 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:02:01,684 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:02:04,280 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:02:04,357 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:02:04,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:02:04,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:02:04,377 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:02:04,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:04 BoogieIcfgContainer [2025-03-03 11:02:04,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:02:04,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:02:04,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:02:04,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:02:04,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:02:00" (1/3) ... [2025-03-03 11:02:04,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e2b6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:04, skipping insertion in model container [2025-03-03 11:02:04,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:00" (2/3) ... [2025-03-03 11:02:04,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e2b6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:04, skipping insertion in model container [2025-03-03 11:02:04,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:04" (3/3) ... [2025-03-03 11:02:04,391 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label49.c [2025-03-03 11:02:04,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:02:04,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label49.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:02:04,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:02:04,470 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;@15eb3936, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:02:04,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:02:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 11:02:04,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:04,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:04,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:04,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash -118679040, now seen corresponding path program 1 times [2025-03-03 11:02:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931675851] [2025-03-03 11:02:04,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:04,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 11:02:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:02:04,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:04,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:04,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931675851] [2025-03-03 11:02:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931675851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485095362] [2025-03-03 11:02:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:04,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:04,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:04,688 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:06,947 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-03 11:02:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:06,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2025-03-03 11:02:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:06,959 INFO L225 Difference]: With dead ends: 1667 [2025-03-03 11:02:06,959 INFO L226 Difference]: Without dead ends: 998 [2025-03-03 11:02:06,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:06,964 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 530 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:06,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:02:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-03 11:02:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-03 11:02:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-03 11:02:07,045 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 15 [2025-03-03 11:02:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-03 11:02:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-03 11:02:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 11:02:07,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:07,047 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] [2025-03-03 11:02:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:02:07,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1048406810, now seen corresponding path program 1 times [2025-03-03 11:02:07,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351752302] [2025-03-03 11:02:07,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:07,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 11:02:07,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 11:02:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:07,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:07,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351752302] [2025-03-03 11:02:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351752302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:07,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134907777] [2025-03-03 11:02:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:07,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:07,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:07,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:07,346 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:08,954 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-03 11:02:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2025-03-03 11:02:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:08,960 INFO L225 Difference]: With dead ends: 2824 [2025-03-03 11:02:08,960 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 11:02:08,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:08,963 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:08,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:02:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 11:02:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-03 11:02:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-03 11:02:08,998 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 80 [2025-03-03 11:02:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-03 11:02:08,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-03 11:02:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 11:02:09,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:09,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:09,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:02:09,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -705778991, now seen corresponding path program 1 times [2025-03-03 11:02:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661456294] [2025-03-03 11:02:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:09,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 11:02:09,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 11:02:09,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:09,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:09,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661456294] [2025-03-03 11:02:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661456294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:09,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:09,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:09,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915560504] [2025-03-03 11:02:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:09,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:09,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:09,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:09,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:09,253 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:10,720 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-03 11:02:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2025-03-03 11:02:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:10,731 INFO L225 Difference]: With dead ends: 4546 [2025-03-03 11:02:10,731 INFO L226 Difference]: Without dead ends: 2704 [2025-03-03 11:02:10,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:10,737 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:10,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-03 11:02:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-03 11:02:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-03 11:02:10,793 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 163 [2025-03-03 11:02:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:10,793 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-03 11:02:10,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-03 11:02:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 11:02:10,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:10,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:10,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:02:10,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash 300768608, now seen corresponding path program 1 times [2025-03-03 11:02:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615031565] [2025-03-03 11:02:10,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:10,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 11:02:10,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 11:02:10,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:10,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 11:02:11,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615031565] [2025-03-03 11:02:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615031565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:11,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119825172] [2025-03-03 11:02:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:11,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:11,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:11,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:11,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:11,022 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:12,755 INFO L93 Difference]: Finished difference Result 7988 states and 11091 transitions. [2025-03-03 11:02:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 169 [2025-03-03 11:02:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:12,780 INFO L225 Difference]: With dead ends: 7988 [2025-03-03 11:02:12,780 INFO L226 Difference]: Without dead ends: 5286 [2025-03-03 11:02:12,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:12,785 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 493 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:12,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 546 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:02:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5286 states. [2025-03-03 11:02:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5286 to 4850. [2025-03-03 11:02:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4849 states have (on average 1.374097752113838) internal successors, (6663), 4849 states have internal predecessors, (6663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 6663 transitions. [2025-03-03 11:02:12,851 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 6663 transitions. Word has length 169 [2025-03-03 11:02:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:12,852 INFO L471 AbstractCegarLoop]: Abstraction has 4850 states and 6663 transitions. [2025-03-03 11:02:12,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 6663 transitions. [2025-03-03 11:02:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 11:02:12,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:12,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:02:12,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:12,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash -961390898, now seen corresponding path program 1 times [2025-03-03 11:02:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836515679] [2025-03-03 11:02:12,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:12,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 11:02:12,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 11:02:12,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:12,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:13,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836515679] [2025-03-03 11:02:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836515679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:13,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957438775] [2025-03-03 11:02:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:13,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:13,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:13,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:13,128 INFO L87 Difference]: Start difference. First operand 4850 states and 6663 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:14,631 INFO L93 Difference]: Finished difference Result 12279 states and 16913 transitions. [2025-03-03 11:02:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 231 [2025-03-03 11:02:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:14,652 INFO L225 Difference]: With dead ends: 12279 [2025-03-03 11:02:14,652 INFO L226 Difference]: Without dead ends: 7005 [2025-03-03 11:02:14,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:14,661 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 370 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:14,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 896 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2025-03-03 11:02:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 6997. [2025-03-03 11:02:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6997 states, 6996 states have (on average 1.262292738707833) internal successors, (8831), 6996 states have internal predecessors, (8831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 8831 transitions. [2025-03-03 11:02:14,767 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 8831 transitions. Word has length 231 [2025-03-03 11:02:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 6997 states and 8831 transitions. [2025-03-03 11:02:14,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 8831 transitions. [2025-03-03 11:02:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 11:02:14,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:14,771 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:14,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:02:14,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:14,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -307497481, now seen corresponding path program 1 times [2025-03-03 11:02:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265655792] [2025-03-03 11:02:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:14,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 11:02:14,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 11:02:14,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:14,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:15,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265655792] [2025-03-03 11:02:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265655792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565444411] [2025-03-03 11:02:15,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:15,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:15,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:15,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:02:15,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 11:02:15,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 11:02:15,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:15,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:15,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:02:15,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:15,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565444411] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:02:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:02:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529151401] [2025-03-03 11:02:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:15,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:15,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:15,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:02:15,720 INFO L87 Difference]: Start difference. First operand 6997 states and 8831 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 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-03-03 11:02:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:18,345 INFO L93 Difference]: Finished difference Result 25957 states and 32554 transitions. [2025-03-03 11:02:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:18,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 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 239 [2025-03-03 11:02:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:18,417 INFO L225 Difference]: With dead ends: 25957 [2025-03-03 11:02:18,417 INFO L226 Difference]: Without dead ends: 17232 [2025-03-03 11:02:18,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:02:18,426 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1072 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 1346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1346 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:18,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 146 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1346 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 11:02:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17232 states. [2025-03-03 11:02:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17232 to 16803. [2025-03-03 11:02:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16803 states, 16802 states have (on average 1.1905725508867993) internal successors, (20004), 16802 states have internal predecessors, (20004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16803 states to 16803 states and 20004 transitions. [2025-03-03 11:02:18,679 INFO L78 Accepts]: Start accepts. Automaton has 16803 states and 20004 transitions. Word has length 239 [2025-03-03 11:02:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 16803 states and 20004 transitions. [2025-03-03 11:02:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 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-03-03 11:02:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16803 states and 20004 transitions. [2025-03-03 11:02:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-03 11:02:18,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:18,686 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:18,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:02:18,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 11:02:18,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash -926674594, now seen corresponding path program 1 times [2025-03-03 11:02:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503255286] [2025-03-03 11:02:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:18,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-03 11:02:18,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-03 11:02:18,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:18,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 11:02:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503255286] [2025-03-03 11:02:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503255286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791476816] [2025-03-03 11:02:19,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:19,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:19,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:19,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:19,092 INFO L87 Difference]: Start difference. First operand 16803 states and 20004 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:20,428 INFO L93 Difference]: Finished difference Result 41703 states and 49648 transitions. [2025-03-03 11:02:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 333 [2025-03-03 11:02:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:20,480 INFO L225 Difference]: With dead ends: 41703 [2025-03-03 11:02:20,481 INFO L226 Difference]: Without dead ends: 24477 [2025-03-03 11:02:20,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:20,499 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 496 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:20,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 209 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24477 states. [2025-03-03 11:02:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24477 to 16773. [2025-03-03 11:02:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16773 states, 16772 states have (on average 1.1900787025995707) internal successors, (19960), 16772 states have internal predecessors, (19960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 19960 transitions. [2025-03-03 11:02:20,842 INFO L78 Accepts]: Start accepts. Automaton has 16773 states and 19960 transitions. Word has length 333 [2025-03-03 11:02:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:20,843 INFO L471 AbstractCegarLoop]: Abstraction has 16773 states and 19960 transitions. [2025-03-03 11:02:20,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16773 states and 19960 transitions. [2025-03-03 11:02:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 11:02:20,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:20,851 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:20,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:02:20,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:20,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:20,852 INFO L85 PathProgramCache]: Analyzing trace with hash 495630524, now seen corresponding path program 1 times [2025-03-03 11:02:20,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:20,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105751167] [2025-03-03 11:02:20,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:20,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 11:02:20,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 11:02:20,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:20,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 186 proven. 78 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105751167] [2025-03-03 11:02:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105751167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:21,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790142787] [2025-03-03 11:02:21,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:21,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:21,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:21,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:02:21,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 11:02:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 11:02:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:21,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:02:21,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 186 proven. 78 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:21,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790142787] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:02:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:02:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705878326] [2025-03-03 11:02:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:21,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:21,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:21,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:02:21,685 INFO L87 Difference]: Start difference. First operand 16773 states and 19960 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:23,829 INFO L93 Difference]: Finished difference Result 47615 states and 56431 transitions. [2025-03-03 11:02:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:23,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 3 states have internal predecessors, (339), 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 351 [2025-03-03 11:02:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:23,888 INFO L225 Difference]: With dead ends: 47615 [2025-03-03 11:02:23,888 INFO L226 Difference]: Without dead ends: 30844 [2025-03-03 11:02:23,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:02:23,902 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 830 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:23,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 190 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:02:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30844 states. [2025-03-03 11:02:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30844 to 30412. [2025-03-03 11:02:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30412 states, 30411 states have (on average 1.1650718490020058) internal successors, (35431), 30411 states have internal predecessors, (35431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30412 states to 30412 states and 35431 transitions. [2025-03-03 11:02:24,209 INFO L78 Accepts]: Start accepts. Automaton has 30412 states and 35431 transitions. Word has length 351 [2025-03-03 11:02:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 30412 states and 35431 transitions. [2025-03-03 11:02:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 30412 states and 35431 transitions. [2025-03-03 11:02:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-03 11:02:24,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:24,216 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:24,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 11:02:24,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 11:02:24,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:24,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash -659957470, now seen corresponding path program 1 times [2025-03-03 11:02:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:24,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107352302] [2025-03-03 11:02:24,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:24,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-03 11:02:24,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-03 11:02:24,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:24,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107352302] [2025-03-03 11:02:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107352302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:24,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:24,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:24,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670915483] [2025-03-03 11:02:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:24,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:24,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:24,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:24,706 INFO L87 Difference]: Start difference. First operand 30412 states and 35431 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:26,107 INFO L93 Difference]: Finished difference Result 75768 states and 88173 transitions. [2025-03-03 11:02:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 377 [2025-03-03 11:02:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:26,192 INFO L225 Difference]: With dead ends: 75768 [2025-03-03 11:02:26,192 INFO L226 Difference]: Without dead ends: 45358 [2025-03-03 11:02:26,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:26,238 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 335 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:26,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 670 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45358 states. [2025-03-03 11:02:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45358 to 42778. [2025-03-03 11:02:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42778 states, 42777 states have (on average 1.1654159945765248) internal successors, (49853), 42777 states have internal predecessors, (49853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42778 states to 42778 states and 49853 transitions. [2025-03-03 11:02:26,947 INFO L78 Accepts]: Start accepts. Automaton has 42778 states and 49853 transitions. Word has length 377 [2025-03-03 11:02:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:26,948 INFO L471 AbstractCegarLoop]: Abstraction has 42778 states and 49853 transitions. [2025-03-03 11:02:26,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 42778 states and 49853 transitions. [2025-03-03 11:02:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-03 11:02:26,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:26,957 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:26,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:02:26,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1366250326, now seen corresponding path program 1 times [2025-03-03 11:02:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459455962] [2025-03-03 11:02:26,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:26,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-03 11:02:27,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-03 11:02:27,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459455962] [2025-03-03 11:02:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459455962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:27,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:02:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735279146] [2025-03-03 11:02:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:27,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:27,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:27,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:27,668 INFO L87 Difference]: Start difference. First operand 42778 states and 49853 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:30,045 INFO L93 Difference]: Finished difference Result 113684 states and 131598 transitions. [2025-03-03 11:02:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:30,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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 420 [2025-03-03 11:02:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:30,121 INFO L225 Difference]: With dead ends: 113684 [2025-03-03 11:02:30,122 INFO L226 Difference]: Without dead ends: 70483 [2025-03-03 11:02:30,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:30,146 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 814 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:30,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 157 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:02:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70483 states. [2025-03-03 11:02:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70483 to 61065. [2025-03-03 11:02:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61065 states, 61064 states have (on average 1.1530525350451986) internal successors, (70410), 61064 states have internal predecessors, (70410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61065 states to 61065 states and 70410 transitions. [2025-03-03 11:02:30,768 INFO L78 Accepts]: Start accepts. Automaton has 61065 states and 70410 transitions. Word has length 420 [2025-03-03 11:02:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:30,769 INFO L471 AbstractCegarLoop]: Abstraction has 61065 states and 70410 transitions. [2025-03-03 11:02:30,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 61065 states and 70410 transitions. [2025-03-03 11:02:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-03 11:02:30,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:30,775 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:30,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:02:30,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -949690042, now seen corresponding path program 1 times [2025-03-03 11:02:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001108165] [2025-03-03 11:02:30,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:30,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-03 11:02:30,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-03 11:02:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:30,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001108165] [2025-03-03 11:02:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001108165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:31,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:31,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:02:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046311352] [2025-03-03 11:02:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:31,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:02:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:31,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:02:31,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:02:31,605 INFO L87 Difference]: Start difference. First operand 61065 states and 70410 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:34,402 INFO L93 Difference]: Finished difference Result 147273 states and 169664 transitions. [2025-03-03 11:02:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:02:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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 427 [2025-03-03 11:02:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:34,493 INFO L225 Difference]: With dead ends: 147273 [2025-03-03 11:02:34,494 INFO L226 Difference]: Without dead ends: 86210 [2025-03-03 11:02:34,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:02:34,533 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1113 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3996 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 4462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 3996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:34,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 262 Invalid, 4462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 3996 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 11:02:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86210 states. [2025-03-03 11:02:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86210 to 79821. [2025-03-03 11:02:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79821 states, 79820 states have (on average 1.1506138812327737) internal successors, (91842), 79820 states have internal predecessors, (91842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79821 states to 79821 states and 91842 transitions. [2025-03-03 11:02:35,783 INFO L78 Accepts]: Start accepts. Automaton has 79821 states and 91842 transitions. Word has length 427 [2025-03-03 11:02:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:35,785 INFO L471 AbstractCegarLoop]: Abstraction has 79821 states and 91842 transitions. [2025-03-03 11:02:35,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 79821 states and 91842 transitions. [2025-03-03 11:02:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 11:02:35,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:35,792 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 11:02:35,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:02:35,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1259406528, now seen corresponding path program 1 times [2025-03-03 11:02:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180136381] [2025-03-03 11:02:35,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:35,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 11:02:35,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 11:02:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:02:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180136381] [2025-03-03 11:02:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180136381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:36,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:36,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:02:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658004261] [2025-03-03 11:02:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:36,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:36,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:36,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:36,250 INFO L87 Difference]: Start difference. First operand 79821 states and 91842 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:38,739 INFO L93 Difference]: Finished difference Result 187792 states and 215104 transitions. [2025-03-03 11:02:38,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:38,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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 459 [2025-03-03 11:02:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:38,871 INFO L225 Difference]: With dead ends: 187792 [2025-03-03 11:02:38,872 INFO L226 Difference]: Without dead ends: 104139 [2025-03-03 11:02:38,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:38,923 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 783 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:38,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 219 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:02:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104139 states. [2025-03-03 11:02:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104139 to 99411. [2025-03-03 11:02:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99411 states, 99410 states have (on average 1.1425510512020924) internal successors, (113581), 99410 states have internal predecessors, (113581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99411 states to 99411 states and 113581 transitions. [2025-03-03 11:02:40,171 INFO L78 Accepts]: Start accepts. Automaton has 99411 states and 113581 transitions. Word has length 459 [2025-03-03 11:02:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:40,172 INFO L471 AbstractCegarLoop]: Abstraction has 99411 states and 113581 transitions. [2025-03-03 11:02:40,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 99411 states and 113581 transitions. [2025-03-03 11:02:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 11:02:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:40,183 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:02:40,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:40,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1556561202, now seen corresponding path program 1 times [2025-03-03 11:02:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148574262] [2025-03-03 11:02:40,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:40,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 11:02:40,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 11:02:40,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:40,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 255 proven. 82 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 11:02:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148574262] [2025-03-03 11:02:40,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148574262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43665234] [2025-03-03 11:02:40,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:40,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:40,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:40,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:02:41,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 11:02:41,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 11:02:41,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:41,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:41,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 11:02:41,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 38 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:42,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43665234] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:02:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 7 [2025-03-03 11:02:44,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356002680] [2025-03-03 11:02:44,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:44,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:44,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:44,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:02:44,741 INFO L87 Difference]: Start difference. First operand 99411 states and 113581 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:46,617 INFO L93 Difference]: Finished difference Result 229015 states and 261837 transitions. [2025-03-03 11:02:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 470 [2025-03-03 11:02:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:46,769 INFO L225 Difference]: With dead ends: 229015 [2025-03-03 11:02:46,769 INFO L226 Difference]: Without dead ends: 129606 [2025-03-03 11:02:46,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:02:46,843 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 264 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:46,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 193 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129606 states. [2025-03-03 11:02:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129606 to 121513. [2025-03-03 11:02:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121513 states, 121512 states have (on average 1.1476891171242347) internal successors, (139458), 121512 states have internal predecessors, (139458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121513 states to 121513 states and 139458 transitions. [2025-03-03 11:02:48,278 INFO L78 Accepts]: Start accepts. Automaton has 121513 states and 139458 transitions. Word has length 470 [2025-03-03 11:02:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:48,278 INFO L471 AbstractCegarLoop]: Abstraction has 121513 states and 139458 transitions. [2025-03-03 11:02:48,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 121513 states and 139458 transitions. [2025-03-03 11:02:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 11:02:48,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:48,288 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:48,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 11:02:48,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:48,489 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:48,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1033487745, now seen corresponding path program 1 times [2025-03-03 11:02:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739434324] [2025-03-03 11:02:48,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:48,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 11:02:48,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 11:02:48,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:48,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 11:02:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739434324] [2025-03-03 11:02:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739434324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:48,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728315858] [2025-03-03 11:02:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:48,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:48,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:48,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:48,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:48,994 INFO L87 Difference]: Start difference. First operand 121513 states and 139458 transitions. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:50,851 INFO L93 Difference]: Finished difference Result 252835 states and 289574 transitions. [2025-03-03 11:02:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:50,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 499 [2025-03-03 11:02:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:51,004 INFO L225 Difference]: With dead ends: 252835 [2025-03-03 11:02:51,004 INFO L226 Difference]: Without dead ends: 131324 [2025-03-03 11:02:51,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:51,054 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 438 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:51,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 272 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131324 states. [2025-03-03 11:02:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131324 to 121088. [2025-03-03 11:02:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121088 states, 121087 states have (on average 1.1478358535598372) internal successors, (138988), 121087 states have internal predecessors, (138988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121088 states to 121088 states and 138988 transitions. [2025-03-03 11:02:52,352 INFO L78 Accepts]: Start accepts. Automaton has 121088 states and 138988 transitions. Word has length 499 [2025-03-03 11:02:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:52,352 INFO L471 AbstractCegarLoop]: Abstraction has 121088 states and 138988 transitions. [2025-03-03 11:02:52,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 121088 states and 138988 transitions. [2025-03-03 11:02:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-03 11:02:52,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:52,363 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:52,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:02:52,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1335901200, now seen corresponding path program 1 times [2025-03-03 11:02:52,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:52,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641446192] [2025-03-03 11:02:52,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:52,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 11:02:52,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 11:02:52,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:52,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 11:02:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641446192] [2025-03-03 11:02:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641446192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:52,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969404391] [2025-03-03 11:02:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:52,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:52,887 INFO L87 Difference]: Start difference. First operand 121088 states and 138988 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:54,495 INFO L93 Difference]: Finished difference Result 270692 states and 310447 transitions. [2025-03-03 11:02:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 502 [2025-03-03 11:02:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:54,810 INFO L225 Difference]: With dead ends: 270692 [2025-03-03 11:02:54,811 INFO L226 Difference]: Without dead ends: 146619 [2025-03-03 11:02:54,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:54,860 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 446 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:54,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 622 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:02:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146619 states. [2025-03-03 11:02:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146619 to 143635. [2025-03-03 11:02:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143635 states, 143634 states have (on average 1.1278805853767213) internal successors, (162002), 143634 states have internal predecessors, (162002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143635 states to 143635 states and 162002 transitions. [2025-03-03 11:02:56,661 INFO L78 Accepts]: Start accepts. Automaton has 143635 states and 162002 transitions. Word has length 502 [2025-03-03 11:02:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:56,661 INFO L471 AbstractCegarLoop]: Abstraction has 143635 states and 162002 transitions. [2025-03-03 11:02:56,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 143635 states and 162002 transitions. [2025-03-03 11:02:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 11:02:56,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:56,672 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:02:56,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:02:56,672 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -591294677, now seen corresponding path program 1 times [2025-03-03 11:02:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459007961] [2025-03-03 11:02:56,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:56,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 11:02:56,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 11:02:56,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 11:02:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459007961] [2025-03-03 11:02:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459007961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:57,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015631015] [2025-03-03 11:02:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:57,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:57,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:57,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:57,037 INFO L87 Difference]: Start difference. First operand 143635 states and 162002 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:58,974 INFO L93 Difference]: Finished difference Result 312377 states and 352219 transitions. [2025-03-03 11:02:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 525 [2025-03-03 11:02:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:59,181 INFO L225 Difference]: With dead ends: 312377 [2025-03-03 11:02:59,181 INFO L226 Difference]: Without dead ends: 168744 [2025-03-03 11:02:59,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:59,251 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 394 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:59,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 294 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:02:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168744 states. [2025-03-03 11:03:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168744 to 167451. [2025-03-03 11:03:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167451 states, 167450 states have (on average 1.111955807703792) internal successors, (186197), 167450 states have internal predecessors, (186197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167451 states to 167451 states and 186197 transitions. [2025-03-03 11:03:01,206 INFO L78 Accepts]: Start accepts. Automaton has 167451 states and 186197 transitions. Word has length 525 [2025-03-03 11:03:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 167451 states and 186197 transitions. [2025-03-03 11:03:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 167451 states and 186197 transitions. [2025-03-03 11:03:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 11:03:01,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:01,224 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:01,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:03:01,225 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:01,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:01,226 INFO L85 PathProgramCache]: Analyzing trace with hash 381438838, now seen corresponding path program 1 times [2025-03-03 11:03:01,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:01,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689816564] [2025-03-03 11:03:01,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:01,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 11:03:01,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 11:03:01,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:01,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:03:01,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:01,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689816564] [2025-03-03 11:03:01,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689816564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:01,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:01,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568262909] [2025-03-03 11:03:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:01,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:01,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:01,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:01,747 INFO L87 Difference]: Start difference. First operand 167451 states and 186197 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:03,508 INFO L93 Difference]: Finished difference Result 352376 states and 391284 transitions. [2025-03-03 11:03:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:03,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 526 [2025-03-03 11:03:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:03,711 INFO L225 Difference]: With dead ends: 352376 [2025-03-03 11:03:03,712 INFO L226 Difference]: Without dead ends: 184927 [2025-03-03 11:03:03,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:03,818 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 305 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:03,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 351 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184927 states. [2025-03-03 11:03:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184927 to 181492. [2025-03-03 11:03:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181492 states, 181491 states have (on average 1.1051401997895212) internal successors, (200573), 181491 states have internal predecessors, (200573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181492 states to 181492 states and 200573 transitions. [2025-03-03 11:03:06,182 INFO L78 Accepts]: Start accepts. Automaton has 181492 states and 200573 transitions. Word has length 526 [2025-03-03 11:03:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:06,182 INFO L471 AbstractCegarLoop]: Abstraction has 181492 states and 200573 transitions. [2025-03-03 11:03:06,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 181492 states and 200573 transitions. [2025-03-03 11:03:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 11:03:06,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:06,191 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 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] [2025-03-03 11:03:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:03:06,191 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:06,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1461974746, now seen corresponding path program 1 times [2025-03-03 11:03:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216280843] [2025-03-03 11:03:06,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:06,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 11:03:06,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 11:03:06,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:06,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-03 11:03:06,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:06,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216280843] [2025-03-03 11:03:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216280843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:06,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:06,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470077017] [2025-03-03 11:03:06,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:06,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:06,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:06,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:06,701 INFO L87 Difference]: Start difference. First operand 181492 states and 200573 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:08,651 INFO L93 Difference]: Finished difference Result 377899 states and 416968 transitions. [2025-03-03 11:03:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:08,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 536 [2025-03-03 11:03:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:08,888 INFO L225 Difference]: With dead ends: 377899 [2025-03-03 11:03:08,888 INFO L226 Difference]: Without dead ends: 196408 [2025-03-03 11:03:08,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:08,993 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 413 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:08,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 353 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196408 states. [2025-03-03 11:03:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196408 to 188720. [2025-03-03 11:03:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188720 states, 188719 states have (on average 1.0952156380650597) internal successors, (206688), 188719 states have internal predecessors, (206688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188720 states to 188720 states and 206688 transitions. [2025-03-03 11:03:11,595 INFO L78 Accepts]: Start accepts. Automaton has 188720 states and 206688 transitions. Word has length 536 [2025-03-03 11:03:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 188720 states and 206688 transitions. [2025-03-03 11:03:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 188720 states and 206688 transitions. [2025-03-03 11:03:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-03-03 11:03:11,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:11,604 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:11,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:03:11,604 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1104409808, now seen corresponding path program 1 times [2025-03-03 11:03:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692742595] [2025-03-03 11:03:11,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:11,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-03 11:03:11,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-03 11:03:11,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:11,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 386 proven. 13 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 11:03:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692742595] [2025-03-03 11:03:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692742595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270771504] [2025-03-03 11:03:12,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:12,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 11:03:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-03 11:03:12,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-03 11:03:12,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:12,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:03:12,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 386 proven. 13 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 11:03:13,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:03:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 11:03:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270771504] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:03:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2025-03-03 11:03:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290693559] [2025-03-03 11:03:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:14,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:14,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:03:14,451 INFO L87 Difference]: Start difference. First operand 188720 states and 206688 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:17,097 INFO L93 Difference]: Finished difference Result 396645 states and 433944 transitions. [2025-03-03 11:03:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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 547 [2025-03-03 11:03:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:17,345 INFO L225 Difference]: With dead ends: 396645 [2025-03-03 11:03:17,345 INFO L226 Difference]: Without dead ends: 207502 [2025-03-03 11:03:17,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1091 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:03:17,707 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 785 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:17,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 127 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:03:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207502 states.