./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:35:24,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:35:25,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:35:25,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:35:25,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:35:25,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:35:25,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:35:25,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:35:25,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:35:25,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:35:25,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:35:25,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:35:25,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:35:25,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:35:25,069 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:35:25,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:35:25,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:35:25,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:35:25,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:35:25,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:35:25,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:35:25,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:35:25,071 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf [2025-02-05 11:35:25,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:35:25,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:35:25,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:35:25,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:35:25,355 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:35:25,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2025-02-05 11:35:26,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b97939738/0fbe4fd03d934fffa167f58959906c6c/FLAGb7aeee278 [2025-02-05 11:35:27,077 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:35:27,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2025-02-05 11:35:27,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b97939738/0fbe4fd03d934fffa167f58959906c6c/FLAGb7aeee278 [2025-02-05 11:35:27,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b97939738/0fbe4fd03d934fffa167f58959906c6c [2025-02-05 11:35:27,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:35:27,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:35:27,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:35:27,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:35:27,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:35:27,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:27" (1/1) ... [2025-02-05 11:35:27,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fd0ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:27, skipping insertion in model container [2025-02-05 11:35:27,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:27" (1/1) ... [2025-02-05 11:35:27,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:35:27,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2025-02-05 11:35:28,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:35:28,054 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:35:28,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2025-02-05 11:35:28,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:35:28,434 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:35:28,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28 WrapperNode [2025-02-05 11:35:28,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:35:28,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:35:28,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:35:28,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:35:28,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:28,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:28,836 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:35:28,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:35:28,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:35:28,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:35:28,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:35:28,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:28,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:28,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,132 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-02-05 11:35:29,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:35:29,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:35:29,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:35:29,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:35:29,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (1/1) ... [2025-02-05 11:35:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:35:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:29,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:35:29,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:35:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:35:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:35:29,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:35:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:35:29,603 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:35:29,605 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:35:34,233 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:35:34,233 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:35:34,234 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:35:34,421 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:35:34,422 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:35:34,458 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:35:34,462 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:35:34,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:34 BoogieIcfgContainer [2025-02-05 11:35:34,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:35:34,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:35:34,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:35:34,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:35:34,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:35:27" (1/3) ... [2025-02-05 11:35:34,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d518582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:34, skipping insertion in model container [2025-02-05 11:35:34,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:28" (2/3) ... [2025-02-05 11:35:34,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d518582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:34, skipping insertion in model container [2025-02-05 11:35:34,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:34" (3/3) ... [2025-02-05 11:35:34,476 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label11.c [2025-02-05 11:35:34,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:35:34,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label11.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:35:34,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:35:34,595 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;@5cf35a66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:35:34,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:35:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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-02-05 11:35:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 11:35:34,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:34,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:34,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:34,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1805527167, now seen corresponding path program 1 times [2025-02-05 11:35:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973708875] [2025-02-05 11:35:34,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:34,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 11:35:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 11:35:34,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973708875] [2025-02-05 11:35:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973708875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:35,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439570572] [2025-02-05 11:35:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:35,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:35,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:35,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:35,042 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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-02-05 11:35:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:38,513 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:35:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:38,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-05 11:35:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:38,537 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:35:38,537 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:35:38,542 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-02-05 11:35:38,547 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 797 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:38,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:35:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:35:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:35:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 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-02-05 11:35:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions. [2025-02-05 11:35:38,668 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 39 [2025-02-05 11:35:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:38,668 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions. [2025-02-05 11:35:38,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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-02-05 11:35:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions. [2025-02-05 11:35:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 11:35:38,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:38,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:35:38,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:35:38,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:38,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:38,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1161254701, now seen corresponding path program 1 times [2025-02-05 11:35:38,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:38,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583028725] [2025-02-05 11:35:38,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:38,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:38,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 11:35:38,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 11:35:38,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:38,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:38,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583028725] [2025-02-05 11:35:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583028725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335703311] [2025-02-05 11:35:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:38,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:38,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:38,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:38,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:38,908 INFO L87 Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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-02-05 11:35:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:42,031 INFO L93 Difference]: Finished difference Result 4514 states and 8420 transitions. [2025-02-05 11:35:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-02-05 11:35:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:42,046 INFO L225 Difference]: With dead ends: 4514 [2025-02-05 11:35:42,046 INFO L226 Difference]: Without dead ends: 3010 [2025-02-05 11:35:42,049 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-02-05 11:35:42,049 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:42,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 353 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:35:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-02-05 11:35:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-02-05 11:35:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.6511473229132025) internal successors, (4965), 3007 states have internal predecessors, (4965), 0 states have call successors, (0), 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-02-05 11:35:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4965 transitions. [2025-02-05 11:35:42,117 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4965 transitions. Word has length 104 [2025-02-05 11:35:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4965 transitions. [2025-02-05 11:35:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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-02-05 11:35:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4965 transitions. [2025-02-05 11:35:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 11:35:42,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:42,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:35:42,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:35:42,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:42,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 355984156, now seen corresponding path program 1 times [2025-02-05 11:35:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:42,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16873694] [2025-02-05 11:35:42,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:42,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 11:35:42,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 11:35:42,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:42,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:42,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:42,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16873694] [2025-02-05 11:35:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16873694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850798742] [2025-02-05 11:35:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:42,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:42,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:42,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:42,533 INFO L87 Difference]: Start difference. First operand 3008 states and 4965 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 11:35:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:45,852 INFO L93 Difference]: Finished difference Result 7555 states and 12123 transitions. [2025-02-05 11:35:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:35:45,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-02-05 11:35:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:45,871 INFO L225 Difference]: With dead ends: 7555 [2025-02-05 11:35:45,872 INFO L226 Difference]: Without dead ends: 4512 [2025-02-05 11:35:45,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:45,877 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 705 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:45,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 606 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:35:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-02-05 11:35:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4510. [2025-02-05 11:35:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.4515413617210025) internal successors, (6545), 4509 states have internal predecessors, (6545), 0 states have call successors, (0), 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-02-05 11:35:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 6545 transitions. [2025-02-05 11:35:45,965 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 6545 transitions. Word has length 110 [2025-02-05 11:35:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 6545 transitions. [2025-02-05 11:35:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 11:35:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 6545 transitions. [2025-02-05 11:35:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 11:35:45,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:45,972 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:35:45,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:35:45,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:45,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1460767520, now seen corresponding path program 1 times [2025-02-05 11:35:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390262695] [2025-02-05 11:35:45,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 11:35:46,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 11:35:46,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:46,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390262695] [2025-02-05 11:35:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390262695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:46,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:46,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402190245] [2025-02-05 11:35:46,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:46,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:46,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:46,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:46,595 INFO L87 Difference]: Start difference. First operand 4510 states and 6545 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-02-05 11:35:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:50,249 INFO L93 Difference]: Finished difference Result 14283 states and 20463 transitions. [2025-02-05 11:35:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:35:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-02-05 11:35:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:50,278 INFO L225 Difference]: With dead ends: 14283 [2025-02-05 11:35:50,278 INFO L226 Difference]: Without dead ends: 9775 [2025-02-05 11:35:50,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:35:50,287 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 2130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:50,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 383 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:35:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2025-02-05 11:35:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 9767. [2025-02-05 11:35:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3653491705918492) internal successors, (13334), 9766 states have internal predecessors, (13334), 0 states have call successors, (0), 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-02-05 11:35:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13334 transitions. [2025-02-05 11:35:50,491 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13334 transitions. Word has length 155 [2025-02-05 11:35:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:50,491 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13334 transitions. [2025-02-05 11:35:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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-02-05 11:35:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13334 transitions. [2025-02-05 11:35:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 11:35:50,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:50,497 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:35:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:35:50,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1533227611, now seen corresponding path program 1 times [2025-02-05 11:35:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182186747] [2025-02-05 11:35:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:50,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 11:35:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 11:35:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 11:35:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182186747] [2025-02-05 11:35:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182186747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:50,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887541950] [2025-02-05 11:35:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:50,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:50,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:50,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:50,796 INFO L87 Difference]: Start difference. First operand 9767 states and 13334 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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-02-05 11:35:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:53,751 INFO L93 Difference]: Finished difference Result 27042 states and 37585 transitions. [2025-02-05 11:35:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:53,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 302 [2025-02-05 11:35:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:53,787 INFO L225 Difference]: With dead ends: 27042 [2025-02-05 11:35:53,788 INFO L226 Difference]: Without dead ends: 17277 [2025-02-05 11:35:53,796 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-02-05 11:35:53,797 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:53,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:35:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2025-02-05 11:35:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 15775. [2025-02-05 11:35:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2816026372511728) internal successors, (20216), 15774 states have internal predecessors, (20216), 0 states have call successors, (0), 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-02-05 11:35:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20216 transitions. [2025-02-05 11:35:54,059 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20216 transitions. Word has length 302 [2025-02-05 11:35:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20216 transitions. [2025-02-05 11:35:54,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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-02-05 11:35:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20216 transitions. [2025-02-05 11:35:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 11:35:54,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:54,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:35:54,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 948087412, now seen corresponding path program 1 times [2025-02-05 11:35:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235167858] [2025-02-05 11:35:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:54,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 11:35:54,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 11:35:54,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:54,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:35:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235167858] [2025-02-05 11:35:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235167858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:54,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581937866] [2025-02-05 11:35:54,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:54,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:54,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:54,788 INFO L87 Difference]: Start difference. First operand 15775 states and 20216 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-02-05 11:35:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:57,933 INFO L93 Difference]: Finished difference Result 39809 states and 52170 transitions. [2025-02-05 11:35:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 381 [2025-02-05 11:35:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:57,982 INFO L225 Difference]: With dead ends: 39809 [2025-02-05 11:35:57,982 INFO L226 Difference]: Without dead ends: 24036 [2025-02-05 11:35:57,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-05 11:35:58,001 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 776 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:58,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 142 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:35:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2025-02-05 11:35:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 23285. [2025-02-05 11:35:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.3032554543892803) internal successors, (30345), 23284 states have internal predecessors, (30345), 0 states have call successors, (0), 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-02-05 11:35:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 30345 transitions. [2025-02-05 11:35:58,260 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 30345 transitions. Word has length 381 [2025-02-05 11:35:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:58,261 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 30345 transitions. [2025-02-05 11:35:58,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-02-05 11:35:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 30345 transitions. [2025-02-05 11:35:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-05 11:35:58,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:58,269 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 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] [2025-02-05 11:35:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:35:58,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash -162248368, now seen corresponding path program 1 times [2025-02-05 11:35:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473590630] [2025-02-05 11:35:58,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:58,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-05 11:35:58,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-05 11:35:58,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:58,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 11:35:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473590630] [2025-02-05 11:35:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473590630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255224939] [2025-02-05 11:35:58,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:58,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:58,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:58,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:58,653 INFO L87 Difference]: Start difference. First operand 23285 states and 30345 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-02-05 11:36:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:01,441 INFO L93 Difference]: Finished difference Result 57082 states and 74478 transitions. [2025-02-05 11:36:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 398 [2025-02-05 11:36:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:01,518 INFO L225 Difference]: With dead ends: 57082 [2025-02-05 11:36:01,519 INFO L226 Difference]: Without dead ends: 33799 [2025-02-05 11:36:01,540 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-02-05 11:36:01,541 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:01,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 217 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:36:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2025-02-05 11:36:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 33048. [2025-02-05 11:36:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33048 states, 33047 states have (on average 1.290797954428541) internal successors, (42657), 33047 states have internal predecessors, (42657), 0 states have call successors, (0), 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-02-05 11:36:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33048 states to 33048 states and 42657 transitions. [2025-02-05 11:36:02,014 INFO L78 Accepts]: Start accepts. Automaton has 33048 states and 42657 transitions. Word has length 398 [2025-02-05 11:36:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:02,015 INFO L471 AbstractCegarLoop]: Abstraction has 33048 states and 42657 transitions. [2025-02-05 11:36:02,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-02-05 11:36:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 33048 states and 42657 transitions. [2025-02-05 11:36:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-05 11:36:02,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:02,024 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 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] [2025-02-05 11:36:02,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:36:02,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:02,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1195285929, now seen corresponding path program 1 times [2025-02-05 11:36:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952680183] [2025-02-05 11:36:02,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:02,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-05 11:36:02,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-05 11:36:02,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 11:36:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952680183] [2025-02-05 11:36:02,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952680183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:02,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449237246] [2025-02-05 11:36:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:02,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:02,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:02,380 INFO L87 Difference]: Start difference. First operand 33048 states and 42657 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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-02-05 11:36:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:05,311 INFO L93 Difference]: Finished difference Result 80363 states and 103507 transitions. [2025-02-05 11:36:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:05,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 409 [2025-02-05 11:36:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:05,399 INFO L225 Difference]: With dead ends: 80363 [2025-02-05 11:36:05,399 INFO L226 Difference]: Without dead ends: 47317 [2025-02-05 11:36:05,427 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-02-05 11:36:05,429 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 719 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:05,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1327 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:36:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47317 states. [2025-02-05 11:36:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 45815. [2025-02-05 11:36:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45815 states, 45814 states have (on average 1.2487449251320557) internal successors, (57210), 45814 states have internal predecessors, (57210), 0 states have call successors, (0), 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-02-05 11:36:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45815 states to 45815 states and 57210 transitions. [2025-02-05 11:36:06,168 INFO L78 Accepts]: Start accepts. Automaton has 45815 states and 57210 transitions. Word has length 409 [2025-02-05 11:36:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:06,170 INFO L471 AbstractCegarLoop]: Abstraction has 45815 states and 57210 transitions. [2025-02-05 11:36:06,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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-02-05 11:36:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 45815 states and 57210 transitions. [2025-02-05 11:36:06,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-02-05 11:36:06,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:06,180 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 2, 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] [2025-02-05 11:36:06,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:36:06,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:06,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash -496555618, now seen corresponding path program 1 times [2025-02-05 11:36:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261511245] [2025-02-05 11:36:06,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:06,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-02-05 11:36:06,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-02-05 11:36:06,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:06,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 11:36:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261511245] [2025-02-05 11:36:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261511245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352076130] [2025-02-05 11:36:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:06,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:06,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:06,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:06,515 INFO L87 Difference]: Start difference. First operand 45815 states and 57210 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-02-05 11:36:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:09,392 INFO L93 Difference]: Finished difference Result 93881 states and 116714 transitions. [2025-02-05 11:36:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:09,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 418 [2025-02-05 11:36:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:09,474 INFO L225 Difference]: With dead ends: 93881 [2025-02-05 11:36:09,474 INFO L226 Difference]: Without dead ends: 47317 [2025-02-05 11:36:09,519 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-02-05 11:36:09,519 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 792 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:09,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1144 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:36:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47317 states. [2025-02-05 11:36:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 45064. [2025-02-05 11:36:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45064 states, 45063 states have (on average 1.2062667820606705) internal successors, (54358), 45063 states have internal predecessors, (54358), 0 states have call successors, (0), 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-02-05 11:36:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 54358 transitions. [2025-02-05 11:36:10,179 INFO L78 Accepts]: Start accepts. Automaton has 45064 states and 54358 transitions. Word has length 418 [2025-02-05 11:36:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:10,180 INFO L471 AbstractCegarLoop]: Abstraction has 45064 states and 54358 transitions. [2025-02-05 11:36:10,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-02-05 11:36:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 45064 states and 54358 transitions. [2025-02-05 11:36:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-05 11:36:10,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:10,188 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:36:10,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:36:10,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:10,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -388323591, now seen corresponding path program 1 times [2025-02-05 11:36:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:10,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958659948] [2025-02-05 11:36:10,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:10,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-05 11:36:10,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-05 11:36:10,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:10,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-05 11:36:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958659948] [2025-02-05 11:36:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958659948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:10,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084314183] [2025-02-05 11:36:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:10,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:10,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:10,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:10,493 INFO L87 Difference]: Start difference. First operand 45064 states and 54358 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-02-05 11:36:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:13,266 INFO L93 Difference]: Finished difference Result 92379 states and 111193 transitions. [2025-02-05 11:36:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 431 [2025-02-05 11:36:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:13,324 INFO L225 Difference]: With dead ends: 92379 [2025-02-05 11:36:13,324 INFO L226 Difference]: Without dead ends: 48068 [2025-02-05 11:36:13,359 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-02-05 11:36:13,360 INFO L435 NwaCegarLoop]: 1248 mSDtfsCounter, 649 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:13,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1256 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:36:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2025-02-05 11:36:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 47317. [2025-02-05 11:36:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47317 states, 47316 states have (on average 1.1867444416265112) internal successors, (56152), 47316 states have internal predecessors, (56152), 0 states have call successors, (0), 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-02-05 11:36:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47317 states to 47317 states and 56152 transitions. [2025-02-05 11:36:13,954 INFO L78 Accepts]: Start accepts. Automaton has 47317 states and 56152 transitions. Word has length 431 [2025-02-05 11:36:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:13,954 INFO L471 AbstractCegarLoop]: Abstraction has 47317 states and 56152 transitions. [2025-02-05 11:36:13,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-02-05 11:36:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47317 states and 56152 transitions. [2025-02-05 11:36:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-05 11:36:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:13,962 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:36:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:36:13,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:13,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1763350383, now seen corresponding path program 1 times [2025-02-05 11:36:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874751436] [2025-02-05 11:36:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:13,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-05 11:36:14,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-05 11:36:14,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:14,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:36:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:14,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874751436] [2025-02-05 11:36:14,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874751436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:14,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:14,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336912583] [2025-02-05 11:36:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:14,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:14,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:14,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:14,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:14,212 INFO L87 Difference]: Start difference. First operand 47317 states and 56152 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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-02-05 11:36:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:16,916 INFO L93 Difference]: Finished difference Result 104395 states and 123123 transitions. [2025-02-05 11:36:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:16,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 435 [2025-02-05 11:36:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:16,982 INFO L225 Difference]: With dead ends: 104395 [2025-02-05 11:36:16,982 INFO L226 Difference]: Without dead ends: 54076 [2025-02-05 11:36:16,995 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-02-05 11:36:16,995 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 731 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:16,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1329 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:36:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54076 states. [2025-02-05 11:36:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54076 to 54076. [2025-02-05 11:36:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54076 states, 54075 states have (on average 1.1470920018492834) internal successors, (62029), 54075 states have internal predecessors, (62029), 0 states have call successors, (0), 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-02-05 11:36:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54076 states to 54076 states and 62029 transitions. [2025-02-05 11:36:17,453 INFO L78 Accepts]: Start accepts. Automaton has 54076 states and 62029 transitions. Word has length 435 [2025-02-05 11:36:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:17,454 INFO L471 AbstractCegarLoop]: Abstraction has 54076 states and 62029 transitions. [2025-02-05 11:36:17,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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-02-05 11:36:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54076 states and 62029 transitions. [2025-02-05 11:36:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-02-05 11:36:17,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:17,463 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:36:17,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:36:17,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1551245179, now seen corresponding path program 1 times [2025-02-05 11:36:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:17,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718545094] [2025-02-05 11:36:17,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:17,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:17,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-05 11:36:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-05 11:36:17,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:17,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-05 11:36:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718545094] [2025-02-05 11:36:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718545094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58067859] [2025-02-05 11:36:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:17,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:17,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:17,922 INFO L87 Difference]: Start difference. First operand 54076 states and 62029 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-05 11:36:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:20,333 INFO L93 Difference]: Finished difference Result 123921 states and 142646 transitions. [2025-02-05 11:36:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 436 [2025-02-05 11:36:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:20,419 INFO L225 Difference]: With dead ends: 123921 [2025-02-05 11:36:20,419 INFO L226 Difference]: Without dead ends: 70598 [2025-02-05 11:36:20,455 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-02-05 11:36:20,456 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 698 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:20,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1188 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:36:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70598 states. [2025-02-05 11:36:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70598 to 70598. [2025-02-05 11:36:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70598 states, 70597 states have (on average 1.1275691601626132) internal successors, (79603), 70597 states have internal predecessors, (79603), 0 states have call successors, (0), 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-02-05 11:36:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70598 states to 70598 states and 79603 transitions. [2025-02-05 11:36:21,410 INFO L78 Accepts]: Start accepts. Automaton has 70598 states and 79603 transitions. Word has length 436 [2025-02-05 11:36:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:21,411 INFO L471 AbstractCegarLoop]: Abstraction has 70598 states and 79603 transitions. [2025-02-05 11:36:21,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-05 11:36:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 70598 states and 79603 transitions. [2025-02-05 11:36:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-02-05 11:36:21,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:21,417 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:36:21,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:36:21,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash 944846122, now seen corresponding path program 1 times [2025-02-05 11:36:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48471972] [2025-02-05 11:36:21,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:21,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-05 11:36:21,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-05 11:36:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-05 11:36:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48471972] [2025-02-05 11:36:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48471972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:21,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105575572] [2025-02-05 11:36:21,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:21,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:21,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:21,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:21,969 INFO L87 Difference]: Start difference. First operand 70598 states and 79603 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-05 11:36:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:24,859 INFO L93 Difference]: Finished difference Result 184752 states and 208856 transitions. [2025-02-05 11:36:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 438 [2025-02-05 11:36:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:25,165 INFO L225 Difference]: With dead ends: 184752 [2025-02-05 11:36:25,165 INFO L226 Difference]: Without dead ends: 114907 [2025-02-05 11:36:25,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:25,203 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 684 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:25,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1290 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:36:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114907 states. [2025-02-05 11:36:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114907 to 102140. [2025-02-05 11:36:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102140 states, 102139 states have (on average 1.1083817151137176) internal successors, (113209), 102139 states have internal predecessors, (113209), 0 states have call successors, (0), 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-02-05 11:36:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102140 states to 102140 states and 113209 transitions. [2025-02-05 11:36:26,554 INFO L78 Accepts]: Start accepts. Automaton has 102140 states and 113209 transitions. Word has length 438 [2025-02-05 11:36:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:26,555 INFO L471 AbstractCegarLoop]: Abstraction has 102140 states and 113209 transitions. [2025-02-05 11:36:26,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-05 11:36:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 102140 states and 113209 transitions. [2025-02-05 11:36:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-05 11:36:26,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:26,561 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:26,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:36:26,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash -538310243, now seen corresponding path program 1 times [2025-02-05 11:36:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519158374] [2025-02-05 11:36:26,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-05 11:36:26,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-05 11:36:26,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:26,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 11:36:26,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:26,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519158374] [2025-02-05 11:36:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519158374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:26,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253870482] [2025-02-05 11:36:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:26,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:26,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:26,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:26,786 INFO L87 Difference]: Start difference. First operand 102140 states and 113209 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-02-05 11:36:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:29,486 INFO L93 Difference]: Finished difference Result 204278 states and 226414 transitions. [2025-02-05 11:36:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 488 [2025-02-05 11:36:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:29,616 INFO L225 Difference]: With dead ends: 204278 [2025-02-05 11:36:29,616 INFO L226 Difference]: Without dead ends: 102891 [2025-02-05 11:36:29,662 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-02-05 11:36:29,662 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 791 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:29,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 219 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:36:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102891 states. [2025-02-05 11:36:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102891 to 95381. [2025-02-05 11:36:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95381 states, 95380 states have (on average 1.0788949465296709) internal successors, (102905), 95380 states have internal predecessors, (102905), 0 states have call successors, (0), 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-02-05 11:36:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95381 states to 95381 states and 102905 transitions. [2025-02-05 11:36:30,843 INFO L78 Accepts]: Start accepts. Automaton has 95381 states and 102905 transitions. Word has length 488 [2025-02-05 11:36:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:30,844 INFO L471 AbstractCegarLoop]: Abstraction has 95381 states and 102905 transitions. [2025-02-05 11:36:30,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-02-05 11:36:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 95381 states and 102905 transitions. [2025-02-05 11:36:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-02-05 11:36:30,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:30,852 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:36:30,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:36:30,852 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:30,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -892160532, now seen corresponding path program 1 times [2025-02-05 11:36:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076454356] [2025-02-05 11:36:30,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:30,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-02-05 11:36:30,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-02-05 11:36:30,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:30,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 11:36:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076454356] [2025-02-05 11:36:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076454356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651363817] [2025-02-05 11:36:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:31,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:31,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:31,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:31,314 INFO L87 Difference]: Start difference. First operand 95381 states and 102905 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-02-05 11:36:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:34,092 INFO L93 Difference]: Finished difference Result 190009 states and 205052 transitions. [2025-02-05 11:36:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 501 [2025-02-05 11:36:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:34,187 INFO L225 Difference]: With dead ends: 190009 [2025-02-05 11:36:34,187 INFO L226 Difference]: Without dead ends: 95381 [2025-02-05 11:36:34,235 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-02-05 11:36:34,235 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 567 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:34,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1243 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:36:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95381 states. [2025-02-05 11:36:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95381 to 91626. [2025-02-05 11:36:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91626 states, 91625 states have (on average 1.056381991814461) internal successors, (96791), 91625 states have internal predecessors, (96791), 0 states have call successors, (0), 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-02-05 11:36:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91626 states to 91626 states and 96791 transitions. [2025-02-05 11:36:35,460 INFO L78 Accepts]: Start accepts. Automaton has 91626 states and 96791 transitions. Word has length 501 [2025-02-05 11:36:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:35,460 INFO L471 AbstractCegarLoop]: Abstraction has 91626 states and 96791 transitions. [2025-02-05 11:36:35,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-02-05 11:36:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 91626 states and 96791 transitions. [2025-02-05 11:36:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 11:36:35,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:35,466 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:35,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:36:35,466 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1861215617, now seen corresponding path program 1 times [2025-02-05 11:36:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834717470] [2025-02-05 11:36:35,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:35,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 11:36:35,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 11:36:35,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:35,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-02-05 11:36:35,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:35,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834717470] [2025-02-05 11:36:35,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834717470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:35,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:35,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:35,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962679412] [2025-02-05 11:36:35,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:35,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:35,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:35,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:35,675 INFO L87 Difference]: Start difference. First operand 91626 states and 96791 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:38,379 INFO L93 Difference]: Finished difference Result 199021 states and 210437 transitions. [2025-02-05 11:36:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:38,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 519 [2025-02-05 11:36:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:38,514 INFO L225 Difference]: With dead ends: 199021 [2025-02-05 11:36:38,514 INFO L226 Difference]: Without dead ends: 108148 [2025-02-05 11:36:38,566 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-02-05 11:36:38,566 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 835 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:38,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1117 Invalid, 2517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:36:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108148 states.