./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label35.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_label35.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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:38:14,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:38:14,980 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:38:14,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:38:14,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:38:15,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:38:15,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:38:15,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:38:15,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:38:15,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:38:15,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:38:15,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:38:15,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:38:15,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:38:15,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:38:15,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:38:15,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:38:15,022 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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2025-02-05 11:38:15,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:38:15,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:38:15,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:38:15,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:38:15,307 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:38:15,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2025-02-05 11:38:16,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fadf5e5f7/5bdc08a7aeac4354bd4a707a2b6d98ab/FLAGd58acd124 [2025-02-05 11:38:17,059 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:38:17,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2025-02-05 11:38:17,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fadf5e5f7/5bdc08a7aeac4354bd4a707a2b6d98ab/FLAGd58acd124 [2025-02-05 11:38:17,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fadf5e5f7/5bdc08a7aeac4354bd4a707a2b6d98ab [2025-02-05 11:38:17,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:38:17,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:38:17,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:38:17,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:38:17,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:38:17,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:38:17" (1/1) ... [2025-02-05 11:38:17,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f2b7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:17, skipping insertion in model container [2025-02-05 11:38:17,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:38:17" (1/1) ... [2025-02-05 11:38:17,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:38:17,836 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_label35.c[1310,1323] [2025-02-05 11:38:18,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:38:18,325 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:38:18,338 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_label35.c[1310,1323] [2025-02-05 11:38:18,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:38:18,604 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:38:18,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18 WrapperNode [2025-02-05 11:38:18,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:38:18,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:38:18,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:38:18,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:38:18,612 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:38:18" (1/1) ... [2025-02-05 11:38:18,655 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:38:18" (1/1) ... [2025-02-05 11:38:18,903 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:38:18,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:38:18,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:38:18,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:38:18,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:38:18,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:18,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:18,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,108 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:38:19,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:38:19,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:38:19,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:38:19,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:38:19,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (1/1) ... [2025-02-05 11:38:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:38:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:19,371 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:38:19,378 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:38:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:38:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:38:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:38:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:38:19,462 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:38:19,463 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:38:22,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:38:22,661 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:38:22,661 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:38:22,831 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:38:22,832 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:38:22,864 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:38:22,865 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:38:22,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:38:22 BoogieIcfgContainer [2025-02-05 11:38:22,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:38:22,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:38:22,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:38:22,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:38:22,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:38:17" (1/3) ... [2025-02-05 11:38:22,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:38:22, skipping insertion in model container [2025-02-05 11:38:22,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:18" (2/3) ... [2025-02-05 11:38:22,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:38:22, skipping insertion in model container [2025-02-05 11:38:22,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:38:22" (3/3) ... [2025-02-05 11:38:22,873 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2025-02-05 11:38:22,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:38:22,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label35.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:38:22,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:38:22,972 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;@270d8a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:38:22,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:38:22,980 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:38:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 11:38:22,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:22,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:22,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -767610705, now seen corresponding path program 1 times [2025-02-05 11:38:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814041754] [2025-02-05 11:38:22,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:23,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 11:38:23,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 11:38:23,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:23,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:23,176 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:38:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:23,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814041754] [2025-02-05 11:38:23,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814041754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:23,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513960711] [2025-02-05 11:38:23,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:23,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:23,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:23,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:23,204 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:38:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:26,060 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:38:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:26,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-05 11:38:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:26,076 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:38:26,077 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:38:26,080 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:38:26,082 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 827 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 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, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:26,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:38:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:38:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:38:26,169 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:38:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-02-05 11:38:26,180 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 7 [2025-02-05 11:38:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:26,181 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-02-05 11:38:26,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:38:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-02-05 11:38:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 11:38:26,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:26,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:26,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:38:26,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1441505972, now seen corresponding path program 1 times [2025-02-05 11:38:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261917401] [2025-02-05 11:38:26,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 11:38:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 11:38:26,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261917401] [2025-02-05 11:38:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261917401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360554828] [2025-02-05 11:38:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:26,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:26,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:26,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:26,469 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:38:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:29,096 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2025-02-05 11:38:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:29,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-02-05 11:38:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:29,106 INFO L225 Difference]: With dead ends: 4512 [2025-02-05 11:38:29,106 INFO L226 Difference]: Without dead ends: 3008 [2025-02-05 11:38:29,111 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:38:29,111 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 772 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:29,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1391 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:38:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-02-05 11:38:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-02-05 11:38:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 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:38:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4100 transitions. [2025-02-05 11:38:29,157 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4100 transitions. Word has length 78 [2025-02-05 11:38:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:29,158 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4100 transitions. [2025-02-05 11:38:29,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:38:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2025-02-05 11:38:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 11:38:29,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:29,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:29,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:38:29,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:29,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash 110121447, now seen corresponding path program 1 times [2025-02-05 11:38:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:29,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143841702] [2025-02-05 11:38:29,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:29,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:29,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 11:38:29,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 11:38:29,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:29,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:29,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:29,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143841702] [2025-02-05 11:38:29,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143841702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:29,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:29,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990480919] [2025-02-05 11:38:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:29,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:29,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:29,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:29,295 INFO L87 Difference]: Start difference. First operand 3008 states and 4100 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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:38:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:31,793 INFO L93 Difference]: Finished difference Result 7516 states and 10661 transitions. [2025-02-05 11:38:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:31,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 11:38:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:31,805 INFO L225 Difference]: With dead ends: 7516 [2025-02-05 11:38:31,805 INFO L226 Difference]: Without dead ends: 4510 [2025-02-05 11:38:31,808 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:38:31,809 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:31,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 520 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:38:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-02-05 11:38:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-02-05 11:38:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 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:38:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5975 transitions. [2025-02-05 11:38:31,862 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5975 transitions. Word has length 81 [2025-02-05 11:38:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5975 transitions. [2025-02-05 11:38:31,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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:38:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2025-02-05 11:38:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 11:38:31,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:31,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:38:31,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2052908081, now seen corresponding path program 1 times [2025-02-05 11:38:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706769074] [2025-02-05 11:38:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:31,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 11:38:31,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 11:38:31,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:31,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706769074] [2025-02-05 11:38:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706769074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256363553] [2025-02-05 11:38:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:31,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:31,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:31,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:31,944 INFO L87 Difference]: Start difference. First operand 4510 states and 5975 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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:38:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:34,711 INFO L93 Difference]: Finished difference Result 13526 states and 17921 transitions. [2025-02-05 11:38:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 11:38:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:34,732 INFO L225 Difference]: With dead ends: 13526 [2025-02-05 11:38:34,732 INFO L226 Difference]: Without dead ends: 9018 [2025-02-05 11:38:34,736 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:38:34,737 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:34,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 618 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:38:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9018 states. [2025-02-05 11:38:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 9016. [2025-02-05 11:38:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.2167498613422074) internal successors, (10969), 9015 states have internal predecessors, (10969), 0 states have call successors, (0), 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:38:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 10969 transitions. [2025-02-05 11:38:34,845 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 10969 transitions. Word has length 92 [2025-02-05 11:38:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:34,845 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 10969 transitions. [2025-02-05 11:38:34,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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:38:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 10969 transitions. [2025-02-05 11:38:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 11:38:34,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:34,847 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:38:34,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:34,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1174956363, now seen corresponding path program 1 times [2025-02-05 11:38:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37703416] [2025-02-05 11:38:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:34,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 11:38:34,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 11:38:34,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:34,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37703416] [2025-02-05 11:38:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37703416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:35,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553408685] [2025-02-05 11:38:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:35,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:38:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:35,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:38:35,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:35,160 INFO L87 Difference]: Start difference. First operand 9016 states and 10969 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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:38:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:37,877 INFO L93 Difference]: Finished difference Result 22575 states and 26968 transitions. [2025-02-05 11:38:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:38:37,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 11:38:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:37,910 INFO L225 Difference]: With dead ends: 22575 [2025-02-05 11:38:37,910 INFO L226 Difference]: Without dead ends: 12022 [2025-02-05 11:38:37,922 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:38:37,922 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3801 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:37,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 706 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3801 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:38:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12022 states. [2025-02-05 11:38:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12022 to 12020. [2025-02-05 11:38:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.1626591230551626) internal successors, (13974), 12019 states have internal predecessors, (13974), 0 states have call successors, (0), 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:38:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 13974 transitions. [2025-02-05 11:38:38,194 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 13974 transitions. Word has length 146 [2025-02-05 11:38:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:38,194 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 13974 transitions. [2025-02-05 11:38:38,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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:38:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 13974 transitions. [2025-02-05 11:38:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 11:38:38,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:38,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:38:38,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 529805270, now seen corresponding path program 1 times [2025-02-05 11:38:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57723075] [2025-02-05 11:38:38,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:38,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 11:38:38,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 11:38:38,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:38,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57723075] [2025-02-05 11:38:38,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57723075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:38,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:38:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843057688] [2025-02-05 11:38:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:38,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:38:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:38,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:38:38,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:38:38,658 INFO L87 Difference]: Start difference. First operand 12020 states and 13974 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:38:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:43,789 INFO L93 Difference]: Finished difference Result 30046 states and 34543 transitions. [2025-02-05 11:38:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:38:43,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 11:38:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:43,818 INFO L225 Difference]: With dead ends: 30046 [2025-02-05 11:38:43,818 INFO L226 Difference]: Without dead ends: 18779 [2025-02-05 11:38:43,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:43,826 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 2114 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7395 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 7548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 7395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:43,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 655 Invalid, 7548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 7395 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 11:38:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18779 states. [2025-02-05 11:38:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18779 to 18028. [2025-02-05 11:38:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.1236478615410217) internal successors, (20256), 18027 states have internal predecessors, (20256), 0 states have call successors, (0), 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:38:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 20256 transitions. [2025-02-05 11:38:44,037 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 20256 transitions. Word has length 151 [2025-02-05 11:38:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:44,038 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 20256 transitions. [2025-02-05 11:38:44,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:38:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 20256 transitions. [2025-02-05 11:38:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 11:38:44,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:44,042 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:44,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:38:44,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:44,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash -284859869, now seen corresponding path program 1 times [2025-02-05 11:38:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:44,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442544288] [2025-02-05 11:38:44,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:44,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 11:38:44,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 11:38:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442544288] [2025-02-05 11:38:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442544288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:44,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245654227] [2025-02-05 11:38:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:44,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:44,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:44,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:44,190 INFO L87 Difference]: Start difference. First operand 18028 states and 20256 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:38:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:46,689 INFO L93 Difference]: Finished difference Result 51074 states and 57668 transitions. [2025-02-05 11:38:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:46,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-02-05 11:38:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:46,834 INFO L225 Difference]: With dead ends: 51074 [2025-02-05 11:38:46,839 INFO L226 Difference]: Without dead ends: 33048 [2025-02-05 11:38:46,856 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:38:46,860 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 668 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:46,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1345 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:38:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33048 states. [2025-02-05 11:38:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33048 to 30044. [2025-02-05 11:38:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.1240555204207303) internal successors, (33770), 30043 states have internal predecessors, (33770), 0 states have call successors, (0), 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:38:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 33770 transitions. [2025-02-05 11:38:47,145 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 33770 transitions. Word has length 233 [2025-02-05 11:38:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:47,146 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 33770 transitions. [2025-02-05 11:38:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:38:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 33770 transitions. [2025-02-05 11:38:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-05 11:38:47,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:47,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:47,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:38:47,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:47,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1413516519, now seen corresponding path program 1 times [2025-02-05 11:38:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240734836] [2025-02-05 11:38:47,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:47,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-05 11:38:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-05 11:38:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:38:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:47,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240734836] [2025-02-05 11:38:47,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240734836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:47,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256585276] [2025-02-05 11:38:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:47,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:47,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:47,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:47,290 INFO L87 Difference]: Start difference. First operand 30044 states and 33770 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:38:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:49,502 INFO L93 Difference]: Finished difference Result 70600 states and 80358 transitions. [2025-02-05 11:38:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 237 [2025-02-05 11:38:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:49,550 INFO L225 Difference]: With dead ends: 70600 [2025-02-05 11:38:49,550 INFO L226 Difference]: Without dead ends: 40558 [2025-02-05 11:38:49,565 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:38:49,565 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 768 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:49,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1221 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:38:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40558 states. [2025-02-05 11:38:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40558 to 40558. [2025-02-05 11:38:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40558 states, 40557 states have (on average 1.1097221194861553) internal successors, (45007), 40557 states have internal predecessors, (45007), 0 states have call successors, (0), 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:38:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 45007 transitions. [2025-02-05 11:38:49,843 INFO L78 Accepts]: Start accepts. Automaton has 40558 states and 45007 transitions. Word has length 237 [2025-02-05 11:38:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:49,843 INFO L471 AbstractCegarLoop]: Abstraction has 40558 states and 45007 transitions. [2025-02-05 11:38:49,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:38:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 40558 states and 45007 transitions. [2025-02-05 11:38:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-05 11:38:49,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:49,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:49,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:38:49,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:49,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash -204675838, now seen corresponding path program 1 times [2025-02-05 11:38:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362443800] [2025-02-05 11:38:49,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:49,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 11:38:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 11:38:49,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-05 11:38:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:49,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362443800] [2025-02-05 11:38:49,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362443800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:49,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:49,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:49,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289470508] [2025-02-05 11:38:49,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:49,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:49,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:49,992 INFO L87 Difference]: Start difference. First operand 40558 states and 45007 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:52,835 INFO L93 Difference]: Finished difference Result 92379 states and 103442 transitions. [2025-02-05 11:38:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 292 [2025-02-05 11:38:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:52,896 INFO L225 Difference]: With dead ends: 92379 [2025-02-05 11:38:52,896 INFO L226 Difference]: Without dead ends: 51823 [2025-02-05 11:38:52,920 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:38:52,923 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 763 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:52,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 313 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:38:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51823 states. [2025-02-05 11:38:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51823 to 48819. [2025-02-05 11:38:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48819 states, 48818 states have (on average 1.128333811299111) internal successors, (55083), 48818 states have internal predecessors, (55083), 0 states have call successors, (0), 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:38:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48819 states to 48819 states and 55083 transitions. [2025-02-05 11:38:53,295 INFO L78 Accepts]: Start accepts. Automaton has 48819 states and 55083 transitions. Word has length 292 [2025-02-05 11:38:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 48819 states and 55083 transitions. [2025-02-05 11:38:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48819 states and 55083 transitions. [2025-02-05 11:38:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 11:38:53,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:53,299 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-02-05 11:38:53,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:38:53,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:53,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2038067544, now seen corresponding path program 1 times [2025-02-05 11:38:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144080872] [2025-02-05 11:38:53,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:53,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:53,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 11:38:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 11:38:53,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:38:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144080872] [2025-02-05 11:38:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144080872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:53,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:53,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806441727] [2025-02-05 11:38:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:53,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:53,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:53,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:53,543 INFO L87 Difference]: Start difference. First operand 48819 states and 55083 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:38:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:56,331 INFO L93 Difference]: Finished difference Result 114158 states and 130684 transitions. [2025-02-05 11:38:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 304 [2025-02-05 11:38:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:56,405 INFO L225 Difference]: With dead ends: 114158 [2025-02-05 11:38:56,405 INFO L226 Difference]: Without dead ends: 65341 [2025-02-05 11:38:56,438 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:38:56,438 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 773 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:56,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1192 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:38:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65341 states. [2025-02-05 11:38:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65341 to 63839. [2025-02-05 11:38:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63839 states, 63838 states have (on average 1.1212913938406592) internal successors, (71581), 63838 states have internal predecessors, (71581), 0 states have call successors, (0), 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:38:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63839 states to 63839 states and 71581 transitions. [2025-02-05 11:38:57,132 INFO L78 Accepts]: Start accepts. Automaton has 63839 states and 71581 transitions. Word has length 304 [2025-02-05 11:38:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:57,133 INFO L471 AbstractCegarLoop]: Abstraction has 63839 states and 71581 transitions. [2025-02-05 11:38:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:38:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 63839 states and 71581 transitions. [2025-02-05 11:38:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-05 11:38:57,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:57,141 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:38:57,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:38:57,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash -223822889, now seen corresponding path program 1 times [2025-02-05 11:38:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818653913] [2025-02-05 11:38:57,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:57,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-05 11:38:57,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-05 11:38:57,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:57,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-02-05 11:38:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818653913] [2025-02-05 11:38:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818653913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:57,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925849677] [2025-02-05 11:38:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:57,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:57,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:57,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:57,296 INFO L87 Difference]: Start difference. First operand 63839 states and 71581 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:00,173 INFO L93 Difference]: Finished difference Result 169734 states and 191828 transitions. [2025-02-05 11:39:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2025-02-05 11:39:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:00,270 INFO L225 Difference]: With dead ends: 169734 [2025-02-05 11:39:00,270 INFO L226 Difference]: Without dead ends: 97636 [2025-02-05 11:39:00,303 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:39:00,303 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 843 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:00,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 315 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:39:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97636 states. [2025-02-05 11:39:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97636 to 84116. [2025-02-05 11:39:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84116 states, 84115 states have (on average 1.1029780657433277) internal successors, (92777), 84115 states have internal predecessors, (92777), 0 states have call successors, (0), 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:39:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84116 states to 84116 states and 92777 transitions. [2025-02-05 11:39:01,155 INFO L78 Accepts]: Start accepts. Automaton has 84116 states and 92777 transitions. Word has length 330 [2025-02-05 11:39:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 84116 states and 92777 transitions. [2025-02-05 11:39:01,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 84116 states and 92777 transitions. [2025-02-05 11:39:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-05 11:39:01,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:01,160 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:39:01,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -53214881, now seen corresponding path program 1 times [2025-02-05 11:39:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915538455] [2025-02-05 11:39:01,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:01,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-05 11:39:01,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-05 11:39:01,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:01,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 11:39:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915538455] [2025-02-05 11:39:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915538455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:01,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:01,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444650541] [2025-02-05 11:39:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:01,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:01,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:01,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:01,332 INFO L87 Difference]: Start difference. First operand 84116 states and 92777 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:39:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:04,263 INFO L93 Difference]: Finished difference Result 170483 states and 187851 transitions. [2025-02-05 11:39:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 404 [2025-02-05 11:39:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:04,368 INFO L225 Difference]: With dead ends: 170483 [2025-02-05 11:39:04,368 INFO L226 Difference]: Without dead ends: 83365 [2025-02-05 11:39:04,416 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:39:04,418 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 739 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:04,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1209 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:39:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83365 states. [2025-02-05 11:39:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83365 to 72851. [2025-02-05 11:39:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72851 states, 72850 states have (on average 1.0672340425531914) internal successors, (77748), 72850 states have internal predecessors, (77748), 0 states have call successors, (0), 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:39:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72851 states to 72851 states and 77748 transitions. [2025-02-05 11:39:05,177 INFO L78 Accepts]: Start accepts. Automaton has 72851 states and 77748 transitions. Word has length 404 [2025-02-05 11:39:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:05,179 INFO L471 AbstractCegarLoop]: Abstraction has 72851 states and 77748 transitions. [2025-02-05 11:39:05,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:39:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 72851 states and 77748 transitions. [2025-02-05 11:39:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-02-05 11:39:05,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:05,184 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:39:05,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1731167064, now seen corresponding path program 1 times [2025-02-05 11:39:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123422603] [2025-02-05 11:39:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:05,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-05 11:39:05,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-05 11:39:05,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:05,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 11:39:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123422603] [2025-02-05 11:39:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123422603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499114368] [2025-02-05 11:39:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:05,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:05,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:05,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:05,584 INFO L87 Difference]: Start difference. First operand 72851 states and 77748 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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:39:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:08,427 INFO L93 Difference]: Finished difference Result 180997 states and 194211 transitions. [2025-02-05 11:39:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:08,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 421 [2025-02-05 11:39:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:08,551 INFO L225 Difference]: With dead ends: 180997 [2025-02-05 11:39:08,552 INFO L226 Difference]: Without dead ends: 108899 [2025-02-05 11:39:08,595 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:39:08,596 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 716 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:08,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 537 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:39:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108899 states. [2025-02-05 11:39:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108899 to 102891. [2025-02-05 11:39:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102891 states, 102890 states have (on average 1.0678297210613277) internal successors, (109869), 102890 states have internal predecessors, (109869), 0 states have call successors, (0), 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:39:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102891 states to 102891 states and 109869 transitions. [2025-02-05 11:39:09,840 INFO L78 Accepts]: Start accepts. Automaton has 102891 states and 109869 transitions. Word has length 421 [2025-02-05 11:39:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:09,841 INFO L471 AbstractCegarLoop]: Abstraction has 102891 states and 109869 transitions. [2025-02-05 11:39:09,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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:39:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 102891 states and 109869 transitions. [2025-02-05 11:39:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-02-05 11:39:09,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:09,847 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:09,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:39:09,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1908698958, now seen corresponding path program 1 times [2025-02-05 11:39:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:09,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836429737] [2025-02-05 11:39:09,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:09,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-02-05 11:39:09,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-02-05 11:39:09,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:09,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 11:39:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836429737] [2025-02-05 11:39:10,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836429737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:10,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:10,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804594823] [2025-02-05 11:39:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:10,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:10,553 INFO L87 Difference]: Start difference. First operand 102891 states and 109869 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:39:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:13,378 INFO L93 Difference]: Finished difference Result 237322 states and 254469 transitions. [2025-02-05 11:39:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 425 [2025-02-05 11:39:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:13,549 INFO L225 Difference]: With dead ends: 237322 [2025-02-05 11:39:13,549 INFO L226 Difference]: Without dead ends: 135184 [2025-02-05 11:39:13,619 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:39:13,620 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 696 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:13,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1270 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:39:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135184 states. [2025-02-05 11:39:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135184 to 125421. [2025-02-05 11:39:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.062828894913092) internal successors, (133300), 125420 states have internal predecessors, (133300), 0 states have call successors, (0), 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:39:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 133300 transitions. [2025-02-05 11:39:15,155 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 133300 transitions. Word has length 425 [2025-02-05 11:39:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 133300 transitions. [2025-02-05 11:39:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:39:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 133300 transitions. [2025-02-05 11:39:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-02-05 11:39:15,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:15,162 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:15,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:39:15,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:15,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2048565842, now seen corresponding path program 1 times [2025-02-05 11:39:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233771280] [2025-02-05 11:39:15,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:15,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-02-05 11:39:15,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-02-05 11:39:15,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:15,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 11:39:15,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:15,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233771280] [2025-02-05 11:39:15,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233771280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:15,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:15,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458475510] [2025-02-05 11:39:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:15,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:15,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:15,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:15,634 INFO L87 Difference]: Start difference. First operand 125421 states and 133300 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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:39:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:18,119 INFO L93 Difference]: Finished difference Result 249338 states and 265060 transitions. [2025-02-05 11:39:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:18,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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:39:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:18,277 INFO L225 Difference]: With dead ends: 249338 [2025-02-05 11:39:18,277 INFO L226 Difference]: Without dead ends: 124670 [2025-02-05 11:39:18,344 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:39:18,344 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 644 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:18,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1149 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:39:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124670 states. [2025-02-05 11:39:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124670 to 123168. [2025-02-05 11:39:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123168 states, 123167 states have (on average 1.0413584807618923) internal successors, (128261), 123167 states have internal predecessors, (128261), 0 states have call successors, (0), 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:39:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123168 states to 123168 states and 128261 transitions. [2025-02-05 11:39:19,772 INFO L78 Accepts]: Start accepts. Automaton has 123168 states and 128261 transitions. Word has length 428 [2025-02-05 11:39:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:19,773 INFO L471 AbstractCegarLoop]: Abstraction has 123168 states and 128261 transitions. [2025-02-05 11:39:19,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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:39:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 123168 states and 128261 transitions. [2025-02-05 11:39:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-02-05 11:39:19,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:19,788 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:19,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:39:19,788 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:19,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:19,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1061046305, now seen corresponding path program 1 times [2025-02-05 11:39:19,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:19,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88652272] [2025-02-05 11:39:19,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:19,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:19,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-02-05 11:39:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-02-05 11:39:19,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:19,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-02-05 11:39:20,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88652272] [2025-02-05 11:39:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88652272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919277569] [2025-02-05 11:39:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:20,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:39:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:20,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:39:20,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:39:20,430 INFO L87 Difference]: Start difference. First operand 123168 states and 128261 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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:39:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:25,168 INFO L93 Difference]: Finished difference Result 391279 states and 407920 transitions. [2025-02-05 11:39:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:39:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 585 [2025-02-05 11:39:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:25,473 INFO L225 Difference]: With dead ends: 391279 [2025-02-05 11:39:25,473 INFO L226 Difference]: Without dead ends: 268864 [2025-02-05 11:39:25,526 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:39:25,527 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1672 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4695 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 4695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:25,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 30 Invalid, 5235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 4695 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 11:39:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268864 states. [2025-02-05 11:39:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268864 to 240324. [2025-02-05 11:39:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240324 states, 240323 states have (on average 1.0414317397835413) internal successors, (250280), 240323 states have internal predecessors, (250280), 0 states have call successors, (0), 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:39:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240324 states to 240324 states and 250280 transitions. [2025-02-05 11:39:28,179 INFO L78 Accepts]: Start accepts. Automaton has 240324 states and 250280 transitions. Word has length 585 [2025-02-05 11:39:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:28,180 INFO L471 AbstractCegarLoop]: Abstraction has 240324 states and 250280 transitions. [2025-02-05 11:39:28,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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:39:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 240324 states and 250280 transitions. [2025-02-05 11:39:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-02-05 11:39:28,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:28,213 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:39:28,217 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash -53275852, now seen corresponding path program 1 times [2025-02-05 11:39:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530103020] [2025-02-05 11:39:28,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:28,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-02-05 11:39:28,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-02-05 11:39:28,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:28,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-02-05 11:39:29,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530103020] [2025-02-05 11:39:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530103020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:29,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:29,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:29,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009808856] [2025-02-05 11:39:29,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:29,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:39:29,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:29,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:39:29,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:39:29,135 INFO L87 Difference]: Start difference. First operand 240324 states and 250280 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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:39:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:34,094 INFO L93 Difference]: Finished difference Result 490411 states and 511086 transitions. [2025-02-05 11:39:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:39:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 607 [2025-02-05 11:39:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:34,457 INFO L225 Difference]: With dead ends: 490411 [2025-02-05 11:39:34,458 INFO L226 Difference]: Without dead ends: 291394 [2025-02-05 11:39:34,556 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:39:34,557 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1690 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4385 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 4385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:34,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 30 Invalid, 5036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 4385 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 11:39:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291394 states. [2025-02-05 11:39:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291394 to 239573. [2025-02-05 11:39:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239573 states, 239572 states have (on average 1.0413195198103284) internal successors, (249471), 239572 states have internal predecessors, (249471), 0 states have call successors, (0), 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:39:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239573 states to 239573 states and 249471 transitions. [2025-02-05 11:39:37,716 INFO L78 Accepts]: Start accepts. Automaton has 239573 states and 249471 transitions. Word has length 607 [2025-02-05 11:39:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:37,717 INFO L471 AbstractCegarLoop]: Abstraction has 239573 states and 249471 transitions. [2025-02-05 11:39:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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:39:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 239573 states and 249471 transitions. [2025-02-05 11:39:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-02-05 11:39:37,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:37,746 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:39:37,746 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1811337016, now seen corresponding path program 1 times [2025-02-05 11:39:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:37,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367682807] [2025-02-05 11:39:37,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-02-05 11:39:38,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-02-05 11:39:38,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:38,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 817 proven. 79 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-02-05 11:39:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367682807] [2025-02-05 11:39:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367682807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338391480] [2025-02-05 11:39:39,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:39,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:39,297 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:39:39,301 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:39:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-02-05 11:39:39,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-02-05 11:39:39,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:39,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:39,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:39:39,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-02-05 11:39:39,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:39:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338391480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:39:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:39:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414129079] [2025-02-05 11:39:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:39,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:39,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:39,628 INFO L87 Difference]: Start difference. First operand 239573 states and 249471 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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:39:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:43,161 INFO L93 Difference]: Finished difference Result 515943 states and 537126 transitions. [2025-02-05 11:39:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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 764 [2025-02-05 11:39:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:43,481 INFO L225 Difference]: With dead ends: 515943 [2025-02-05 11:39:43,481 INFO L226 Difference]: Without dead ends: 277123 [2025-02-05 11:39:43,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:43,528 INFO L435 NwaCegarLoop]: 1184 mSDtfsCounter, 705 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:43,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1191 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:39:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277123 states. [2025-02-05 11:39:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277123 to 260601. [2025-02-05 11:39:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260601 states, 260600 states have (on average 1.037851112816577) internal successors, (270464), 260600 states have internal predecessors, (270464), 0 states have call successors, (0), 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:39:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260601 states to 260601 states and 270464 transitions. [2025-02-05 11:39:46,128 INFO L78 Accepts]: Start accepts. Automaton has 260601 states and 270464 transitions. Word has length 764 [2025-02-05 11:39:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:46,129 INFO L471 AbstractCegarLoop]: Abstraction has 260601 states and 270464 transitions. [2025-02-05 11:39:46,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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:39:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 260601 states and 270464 transitions. [2025-02-05 11:39:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2025-02-05 11:39:46,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:46,621 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:46,628 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:39:46,825 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,SelfDestructingSolverStorable17 [2025-02-05 11:39:46,825 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:46,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash -509826381, now seen corresponding path program 1 times [2025-02-05 11:39:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:46,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191760997] [2025-02-05 11:39:46,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:46,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes.