./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label08.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_label08.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 6974994fa41c2218950105a3f2a905efa9ed2213c945e8187ea9622e98b47d24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:35:10,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:35:10,706 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:10,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:35:10,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:35:10,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:35:10,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:35:10,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:35:10,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:35:10,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:35:10,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:35:10,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:35:10,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:35:10,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:35:10,738 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:35:10,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:35:10,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:35:10,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:35:10,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:35:10,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:35:10,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:35:10,740 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 -> 6974994fa41c2218950105a3f2a905efa9ed2213c945e8187ea9622e98b47d24 [2025-02-05 11:35:11,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:35:11,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:35:11,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:35:11,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:35:11,018 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:35:11,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label08.c [2025-02-05 11:35:12,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/714123245/b9a6bfe48ab44aa585a1cd5b363f8e9f/FLAG2199da325 [2025-02-05 11:35:12,772 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:35:12,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label08.c [2025-02-05 11:35:12,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/714123245/b9a6bfe48ab44aa585a1cd5b363f8e9f/FLAG2199da325 [2025-02-05 11:35:13,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/714123245/b9a6bfe48ab44aa585a1cd5b363f8e9f [2025-02-05 11:35:13,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:35:13,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:35:13,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:35:13,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:35:13,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:35:13,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:13" (1/1) ... [2025-02-05 11:35:13,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:13, skipping insertion in model container [2025-02-05 11:35:13,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:13" (1/1) ... [2025-02-05 11:35:13,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:35:13,601 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_label08.c[3868,3881] [2025-02-05 11:35:14,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:35:14,113 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:35:14,127 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_label08.c[3868,3881] [2025-02-05 11:35:14,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:35:14,482 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:35:14,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:14 WrapperNode [2025-02-05 11:35:14,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:35:14,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:35:14,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:35:14,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:35:14,489 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:14" (1/1) ... [2025-02-05 11:35:14,533 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:14" (1/1) ... [2025-02-05 11:35:14,849 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:35:14,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:35:14,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:35:14,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:35:14,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:35:14,885 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:14" (1/1) ... [2025-02-05 11:35:14,886 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:14" (1/1) ... [2025-02-05 11:35:14,927 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:14" (1/1) ... [2025-02-05 11:35:15,095 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:15,096 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:14" (1/1) ... [2025-02-05 11:35:15,096 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:14" (1/1) ... [2025-02-05 11:35:15,171 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:14" (1/1) ... [2025-02-05 11:35:15,189 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:14" (1/1) ... [2025-02-05 11:35:15,203 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:14" (1/1) ... [2025-02-05 11:35:15,218 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:14" (1/1) ... [2025-02-05 11:35:15,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:35:15,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:35:15,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:35:15,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:35:15,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:14" (1/1) ... [2025-02-05 11:35:15,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:35:15,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:15,278 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:15,286 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:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:35:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:35:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:35:15,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:35:15,371 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:35:15,373 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:35:20,163 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:35:20,168 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:35:20,169 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:35:20,487 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:35:20,487 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:35:20,506 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:35:20,507 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:35:20,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:20 BoogieIcfgContainer [2025-02-05 11:35:20,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:35:20,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:35:20,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:35:20,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:35:20,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:35:13" (1/3) ... [2025-02-05 11:35:20,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9dbe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:20, skipping insertion in model container [2025-02-05 11:35:20,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:14" (2/3) ... [2025-02-05 11:35:20,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9dbe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:20, skipping insertion in model container [2025-02-05 11:35:20,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:20" (3/3) ... [2025-02-05 11:35:20,515 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label08.c [2025-02-05 11:35:20,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:35:20,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label08.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:35:20,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:35:20,602 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;@60ba10d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:35:20,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:35:20,609 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:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 11:35:20,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:20,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] [2025-02-05 11:35:20,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:20,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1024977650, now seen corresponding path program 1 times [2025-02-05 11:35:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247694898] [2025-02-05 11:35:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:20,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 11:35:20,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 11:35:20,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:20,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:20,884 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:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:20,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247694898] [2025-02-05 11:35:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247694898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:20,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446540197] [2025-02-05 11:35:20,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:20,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:20,914 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 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:24,229 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:35:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:24,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 11:35:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:24,252 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:35:24,253 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:35:24,260 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:24,262 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 805 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:24,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:35:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:35:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:35:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 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:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-02-05 11:35:24,355 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 29 [2025-02-05 11:35:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:24,355 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-02-05 11:35:24,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-02-05 11:35:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 11:35:24,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:24,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:35:24,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1564956853, now seen corresponding path program 1 times [2025-02-05 11:35:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:24,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536397931] [2025-02-05 11:35:24,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:24,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 11:35:24,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 11:35:24,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:24,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 11:35:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:24,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536397931] [2025-02-05 11:35:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536397931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:24,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:24,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:24,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907124643] [2025-02-05 11:35:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:24,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:24,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:24,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:24,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:24,540 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:27,506 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2025-02-05 11:35:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 100 [2025-02-05 11:35:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:27,528 INFO L225 Difference]: With dead ends: 4512 [2025-02-05 11:35:27,528 INFO L226 Difference]: Without dead ends: 3008 [2025-02-05 11:35:27,530 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:27,531 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:27,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 475 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:35:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-02-05 11:35:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-02-05 11:35:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4253408713002993) internal successors, (4286), 3007 states have internal predecessors, (4286), 0 states have call successors, (0), 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:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4286 transitions. [2025-02-05 11:35:27,638 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4286 transitions. Word has length 100 [2025-02-05 11:35:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:27,639 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4286 transitions. [2025-02-05 11:35:27,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4286 transitions. [2025-02-05 11:35:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 11:35:27,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:27,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:35:27,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:27,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1596785387, now seen corresponding path program 1 times [2025-02-05 11:35:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:27,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160706545] [2025-02-05 11:35:27,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:27,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 11:35:27,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 11:35:27,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:27,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:27,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160706545] [2025-02-05 11:35:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160706545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220745662] [2025-02-05 11:35:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:27,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:27,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:27,812 INFO L87 Difference]: Start difference. First operand 3008 states and 4286 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:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:30,666 INFO L93 Difference]: Finished difference Result 9020 states and 12854 transitions. [2025-02-05 11:35:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:30,667 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:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:30,684 INFO L225 Difference]: With dead ends: 9020 [2025-02-05 11:35:30,685 INFO L226 Difference]: Without dead ends: 6014 [2025-02-05 11:35:30,687 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:30,690 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:30,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:35:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2025-02-05 11:35:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2025-02-05 11:35:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.3287306604558309) internal successors, (7987), 6011 states have internal predecessors, (7987), 0 states have call successors, (0), 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:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7987 transitions. [2025-02-05 11:35:30,767 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7987 transitions. Word has length 104 [2025-02-05 11:35:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:30,768 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7987 transitions. [2025-02-05 11:35:30,768 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:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7987 transitions. [2025-02-05 11:35:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 11:35:30,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:30,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:35:30,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:30,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 321563722, now seen corresponding path program 1 times [2025-02-05 11:35:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:30,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252008477] [2025-02-05 11:35:30,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:30,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:30,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 11:35:30,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 11:35:30,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:30,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252008477] [2025-02-05 11:35:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252008477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421367573] [2025-02-05 11:35:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:31,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:31,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:31,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:31,060 INFO L87 Difference]: Start difference. First operand 6012 states and 7987 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:34,961 INFO L93 Difference]: Finished difference Result 18781 states and 24767 transitions. [2025-02-05 11:35:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:35:34,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-02-05 11:35:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:34,995 INFO L225 Difference]: With dead ends: 18781 [2025-02-05 11:35:34,996 INFO L226 Difference]: Without dead ends: 12771 [2025-02-05 11:35:35,002 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:35,006 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 2102 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4868 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 5557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 4868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:35,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 267 Invalid, 5557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 4868 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 11:35:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2025-02-05 11:35:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12771. [2025-02-05 11:35:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.2919342208300704) internal successors, (16498), 12770 states have internal predecessors, (16498), 0 states have call successors, (0), 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:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 16498 transitions. [2025-02-05 11:35:35,192 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 16498 transitions. Word has length 138 [2025-02-05 11:35:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:35,193 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 16498 transitions. [2025-02-05 11:35:35,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 16498 transitions. [2025-02-05 11:35:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 11:35:35,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:35,195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:35:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:35:35,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 210010380, now seen corresponding path program 1 times [2025-02-05 11:35:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461025581] [2025-02-05 11:35:35,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:35,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 11:35:35,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 11:35:35,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:35,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461025581] [2025-02-05 11:35:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461025581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277461843] [2025-02-05 11:35:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:35,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:35,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:35,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:35,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:35,564 INFO L87 Difference]: Start difference. First operand 12771 states and 16498 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:38,869 INFO L93 Difference]: Finished difference Result 27830 states and 35620 transitions. [2025-02-05 11:35:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:35:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2025-02-05 11:35:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:38,984 INFO L225 Difference]: With dead ends: 27830 [2025-02-05 11:35:38,987 INFO L226 Difference]: Without dead ends: 15775 [2025-02-05 11:35:39,006 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:39,011 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 3903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:39,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 3903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:35:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-02-05 11:35:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2025-02-05 11:35:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2426778242677825) internal successors, (19602), 15774 states have internal predecessors, (19602), 0 states have call successors, (0), 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:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19602 transitions. [2025-02-05 11:35:39,406 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19602 transitions. Word has length 216 [2025-02-05 11:35:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:39,406 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19602 transitions. [2025-02-05 11:35:39,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19602 transitions. [2025-02-05 11:35:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 11:35:39,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:39,412 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:35:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:35:39,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1738812479, now seen corresponding path program 1 times [2025-02-05 11:35:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89034351] [2025-02-05 11:35:39,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:39,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 11:35:39,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 11:35:39,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:35:39,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:39,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89034351] [2025-02-05 11:35:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89034351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:39,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:39,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54545851] [2025-02-05 11:35:39,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:39,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:39,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:39,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:39,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:39,759 INFO L87 Difference]: Start difference. First operand 15775 states and 19602 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:43,102 INFO L93 Difference]: Finished difference Result 36805 states and 47114 transitions. [2025-02-05 11:35:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:43,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2025-02-05 11:35:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:43,138 INFO L225 Difference]: With dead ends: 36805 [2025-02-05 11:35:43,138 INFO L226 Difference]: Without dead ends: 21783 [2025-02-05 11:35:43,147 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:35:43,148 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 737 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:43,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 597 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [612 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:35:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21783 states. [2025-02-05 11:35:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21783 to 15775. [2025-02-05 11:35:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2426778242677825) internal successors, (19602), 15774 states have internal predecessors, (19602), 0 states have call successors, (0), 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:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19602 transitions. [2025-02-05 11:35:43,323 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19602 transitions. Word has length 241 [2025-02-05 11:35:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:43,324 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19602 transitions. [2025-02-05 11:35:43,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19602 transitions. [2025-02-05 11:35:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 11:35:43,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:43,326 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:35:43,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:35:43,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:43,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:43,327 INFO L85 PathProgramCache]: Analyzing trace with hash 460404728, now seen corresponding path program 1 times [2025-02-05 11:35:43,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:43,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727450681] [2025-02-05 11:35:43,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:43,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:43,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 11:35:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 11:35:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:35:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727450681] [2025-02-05 11:35:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727450681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298515636] [2025-02-05 11:35:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:43,527 INFO L87 Difference]: Start difference. First operand 15775 states and 19602 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:46,493 INFO L93 Difference]: Finished difference Result 44315 states and 55660 transitions. [2025-02-05 11:35:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:46,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-02-05 11:35:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:46,588 INFO L225 Difference]: With dead ends: 44315 [2025-02-05 11:35:46,592 INFO L226 Difference]: Without dead ends: 29293 [2025-02-05 11:35:46,758 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:35:46,758 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 735 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:46,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1281 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:35:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29293 states. [2025-02-05 11:35:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29293 to 25538. [2025-02-05 11:35:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25538 states, 25537 states have (on average 1.1892156478834632) internal successors, (30369), 25537 states have internal predecessors, (30369), 0 states have call successors, (0), 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:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 30369 transitions. [2025-02-05 11:35:46,967 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 30369 transitions. Word has length 259 [2025-02-05 11:35:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:46,967 INFO L471 AbstractCegarLoop]: Abstraction has 25538 states and 30369 transitions. [2025-02-05 11:35:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 30369 transitions. [2025-02-05 11:35:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 11:35:46,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:46,971 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:35:46,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:35:46,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:46,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 418917142, now seen corresponding path program 1 times [2025-02-05 11:35:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:46,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830255418] [2025-02-05 11:35:46,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:46,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 11:35:47,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 11:35:47,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:47,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 11:35:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:47,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830255418] [2025-02-05 11:35:47,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830255418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:47,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:47,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:35:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662157877] [2025-02-05 11:35:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:47,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:47,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:47,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:47,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:47,111 INFO L87 Difference]: Start difference. First operand 25538 states and 30369 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:49,745 INFO L93 Difference]: Finished difference Result 63090 states and 76383 transitions. [2025-02-05 11:35:49,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2025-02-05 11:35:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:49,786 INFO L225 Difference]: With dead ends: 63090 [2025-02-05 11:35:49,786 INFO L226 Difference]: Without dead ends: 38305 [2025-02-05 11:35:49,806 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:49,807 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:49,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 433 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [856 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:35:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38305 states. [2025-02-05 11:35:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38305 to 34550. [2025-02-05 11:35:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.1671538973631654) internal successors, (40324), 34549 states have internal predecessors, (40324), 0 states have call successors, (0), 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,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 40324 transitions. [2025-02-05 11:35:50,238 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 40324 transitions. Word has length 263 [2025-02-05 11:35:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 40324 transitions. [2025-02-05 11:35:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 40324 transitions. [2025-02-05 11:35:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-05 11:35:50,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:50,244 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:35:50,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:50,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash -541630683, now seen corresponding path program 1 times [2025-02-05 11:35:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793480900] [2025-02-05 11:35:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:50,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-05 11:35:50,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-05 11:35:50,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:50,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:35:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793480900] [2025-02-05 11:35:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793480900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800064697] [2025-02-05 11:35:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:50,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:50,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:50,422 INFO L87 Difference]: Start difference. First operand 34550 states and 40324 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:53,214 INFO L93 Difference]: Finished difference Result 84869 states and 100644 transitions. [2025-02-05 11:35:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 367 [2025-02-05 11:35:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:53,314 INFO L225 Difference]: With dead ends: 84869 [2025-02-05 11:35:53,317 INFO L226 Difference]: Without dead ends: 51072 [2025-02-05 11:35:53,342 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:35:53,347 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:53,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 560 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:35:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51072 states. [2025-02-05 11:35:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51072 to 49570. [2025-02-05 11:35:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49570 states, 49569 states have (on average 1.1648005810082915) internal successors, (57738), 49569 states have internal predecessors, (57738), 0 states have call successors, (0), 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,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49570 states to 49570 states and 57738 transitions. [2025-02-05 11:35:53,866 INFO L78 Accepts]: Start accepts. Automaton has 49570 states and 57738 transitions. Word has length 367 [2025-02-05 11:35:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:53,867 INFO L471 AbstractCegarLoop]: Abstraction has 49570 states and 57738 transitions. [2025-02-05 11:35:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49570 states and 57738 transitions. [2025-02-05 11:35:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 11:35:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:53,871 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:35:53,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1715125800, now seen corresponding path program 1 times [2025-02-05 11:35:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965657289] [2025-02-05 11:35:53,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:53,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 11:35:53,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 11:35:53,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:53,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 11:35:54,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:54,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965657289] [2025-02-05 11:35:54,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965657289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:54,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360246134] [2025-02-05 11:35:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:54,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:54,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:54,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:54,167 INFO L87 Difference]: Start difference. First operand 49570 states and 57738 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:56,735 INFO L93 Difference]: Finished difference Result 123921 states and 145842 transitions. [2025-02-05 11:35:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 384 [2025-02-05 11:35:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:56,811 INFO L225 Difference]: With dead ends: 123921 [2025-02-05 11:35:56,811 INFO L226 Difference]: Without dead ends: 75104 [2025-02-05 11:35:56,839 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:35:56,840 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 717 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:56,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1282 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:35:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75104 states. [2025-02-05 11:35:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75104 to 72100. [2025-02-05 11:35:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72100 states, 72099 states have (on average 1.1412086159308727) internal successors, (82280), 72099 states have internal predecessors, (82280), 0 states have call successors, (0), 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,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72100 states to 72100 states and 82280 transitions. [2025-02-05 11:35:57,704 INFO L78 Accepts]: Start accepts. Automaton has 72100 states and 82280 transitions. Word has length 384 [2025-02-05 11:35:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:57,705 INFO L471 AbstractCegarLoop]: Abstraction has 72100 states and 82280 transitions. [2025-02-05 11:35:57,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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,705 INFO L276 IsEmpty]: Start isEmpty. Operand 72100 states and 82280 transitions. [2025-02-05 11:35:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-05 11:35:57,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:57,711 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:35:57,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:57,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 782481650, now seen corresponding path program 1 times [2025-02-05 11:35:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953616665] [2025-02-05 11:35:57,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:57,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:57,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-05 11:35:57,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-05 11:35:57,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:57,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 338 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:35:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953616665] [2025-02-05 11:35:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953616665] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:35:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293330244] [2025-02-05 11:35:58,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:58,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:58,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:35:58,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:35:58,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-05 11:35:58,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-05 11:35:58,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:58,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:58,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:35:58,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:35:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 246 proven. 27 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 11:35:59,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:35:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 246 proven. 27 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 11:35:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293330244] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:35:59,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:35:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-02-05 11:35:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939540518] [2025-02-05 11:35:59,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:35:59,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:35:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:59,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:35:59,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:35:59,576 INFO L87 Difference]: Start difference. First operand 72100 states and 82280 transitions. Second operand has 10 states, 10 states have (on average 78.3) internal successors, (783), 10 states have internal predecessors, (783), 0 states have call successors, (0), 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,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:29,057 INFO L93 Difference]: Finished difference Result 267536 states and 305572 transitions. [2025-02-05 11:36:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 11:36:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 78.3) internal successors, (783), 10 states have internal predecessors, (783), 0 states have call successors, (0), 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 388 [2025-02-05 11:36:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:29,289 INFO L225 Difference]: With dead ends: 267536 [2025-02-05 11:36:29,290 INFO L226 Difference]: Without dead ends: 184754 [2025-02-05 11:36:29,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 11:36:29,348 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 17833 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 43198 mSolverCounterSat, 6033 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17833 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 49231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6033 IncrementalHoareTripleChecker+Valid, 43198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:29,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17833 Valid, 338 Invalid, 49231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6033 Valid, 43198 Invalid, 0 Unknown, 0 Unchecked, 27.2s Time] [2025-02-05 11:36:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184754 states. [2025-02-05 11:36:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184754 to 156963. [2025-02-05 11:36:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156963 states, 156962 states have (on average 1.1026235649392846) internal successors, (173070), 156962 states have internal predecessors, (173070), 0 states have call successors, (0), 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:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156963 states to 156963 states and 173070 transitions. [2025-02-05 11:36:31,452 INFO L78 Accepts]: Start accepts. Automaton has 156963 states and 173070 transitions. Word has length 388 [2025-02-05 11:36:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:31,453 INFO L471 AbstractCegarLoop]: Abstraction has 156963 states and 173070 transitions. [2025-02-05 11:36:31,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.3) internal successors, (783), 10 states have internal predecessors, (783), 0 states have call successors, (0), 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:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 156963 states and 173070 transitions. [2025-02-05 11:36:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 11:36:31,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:31,470 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:31,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:36:31,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 11:36:31,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:31,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash -688474567, now seen corresponding path program 1 times [2025-02-05 11:36:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:31,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977481864] [2025-02-05 11:36:31,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 11:36:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 11:36:31,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:31,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-05 11:36:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977481864] [2025-02-05 11:36:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977481864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:32,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:32,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:32,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441253662] [2025-02-05 11:36:32,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:32,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:32,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:32,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:32,146 INFO L87 Difference]: Start difference. First operand 156963 states and 173070 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:35,352 INFO L93 Difference]: Finished difference Result 328944 states and 364143 transitions. [2025-02-05 11:36:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:35,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2025-02-05 11:36:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:35,593 INFO L225 Difference]: With dead ends: 328944 [2025-02-05 11:36:35,593 INFO L226 Difference]: Without dead ends: 171983 [2025-02-05 11:36:35,701 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:35,702 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 701 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:35,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1142 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:36:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171983 states. [2025-02-05 11:36:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171983 to 168979. [2025-02-05 11:36:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168979 states, 168978 states have (on average 1.0889701617962102) internal successors, (184012), 168978 states have internal predecessors, (184012), 0 states have call successors, (0), 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:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168979 states to 168979 states and 184012 transitions. [2025-02-05 11:36:37,894 INFO L78 Accepts]: Start accepts. Automaton has 168979 states and 184012 transitions. Word has length 428 [2025-02-05 11:36:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:37,895 INFO L471 AbstractCegarLoop]: Abstraction has 168979 states and 184012 transitions. [2025-02-05 11:36:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 168979 states and 184012 transitions. [2025-02-05 11:36:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-05 11:36:37,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:37,900 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:37,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:36:37,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:37,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1486855555, now seen corresponding path program 1 times [2025-02-05 11:36:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:37,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821595846] [2025-02-05 11:36:37,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:37,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-05 11:36:37,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-05 11:36:37,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:37,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-02-05 11:36:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821595846] [2025-02-05 11:36:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821595846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:38,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451459071] [2025-02-05 11:36:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:38,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:38,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:38,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:38,062 INFO L87 Difference]: Start difference. First operand 168979 states and 184012 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:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:41,405 INFO L93 Difference]: Finished difference Result 342462 states and 372597 transitions. [2025-02-05 11:36:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:41,406 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 469 [2025-02-05 11:36:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:41,638 INFO L225 Difference]: With dead ends: 342462 [2025-02-05 11:36:41,639 INFO L226 Difference]: Without dead ends: 166726 [2025-02-05 11:36:41,715 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:41,715 INFO L435 NwaCegarLoop]: 1155 mSDtfsCounter, 707 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:41,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1163 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:36:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166726 states. [2025-02-05 11:36:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166726 to 158465. [2025-02-05 11:36:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158465 states, 158464 states have (on average 1.0557602988691437) internal successors, (167300), 158464 states have internal predecessors, (167300), 0 states have call successors, (0), 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:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158465 states to 158465 states and 167300 transitions. [2025-02-05 11:36:43,659 INFO L78 Accepts]: Start accepts. Automaton has 158465 states and 167300 transitions. Word has length 469 [2025-02-05 11:36:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:43,659 INFO L471 AbstractCegarLoop]: Abstraction has 158465 states and 167300 transitions. [2025-02-05 11:36:43,659 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:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 158465 states and 167300 transitions. [2025-02-05 11:36:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-02-05 11:36:43,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:43,666 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:36:43,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1504334079, now seen corresponding path program 1 times [2025-02-05 11:36:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305525994] [2025-02-05 11:36:43,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:43,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-02-05 11:36:43,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-02-05 11:36:43,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:43,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-02-05 11:36:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305525994] [2025-02-05 11:36:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305525994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977045703] [2025-02-05 11:36:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:44,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:44,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:44,790 INFO L87 Difference]: Start difference. First operand 158465 states and 167300 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)