./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem04_label42.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/Problem04_label42.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 6984728535a86bc75e43b65ba9922d2fd4380b8ba43e1e847faf7255b525a964 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:53:20,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:53:20,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:53:20,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:53:20,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:53:20,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:53:20,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:53:20,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:53:20,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:53:20,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:53:20,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:53:20,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:53:20,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:53:20,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:53:20,310 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:53:20,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:53:20,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:53:20,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:53:20,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:53:20,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:53:20,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:53:20,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:53:20,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:53:20,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:53:20,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:53:20,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:53:20,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:53:20,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:53:20,313 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 -> 6984728535a86bc75e43b65ba9922d2fd4380b8ba43e1e847faf7255b525a964 [2025-02-05 10:53:20,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:53:20,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:53:20,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:53:20,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:53:20,590 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:53:20,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem04_label42.c [2025-02-05 10:53:21,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b42aff2f/73172f2060f5450eafcf50968ed9f1cd/FLAGcb0330aa5 [2025-02-05 10:53:22,404 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:53:22,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem04_label42.c [2025-02-05 10:53:22,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b42aff2f/73172f2060f5450eafcf50968ed9f1cd/FLAGcb0330aa5 [2025-02-05 10:53:22,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b42aff2f/73172f2060f5450eafcf50968ed9f1cd [2025-02-05 10:53:22,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:53:22,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:53:22,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:53:22,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:53:22,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:53:22,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:22" (1/1) ... [2025-02-05 10:53:22,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11af817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:22, skipping insertion in model container [2025-02-05 10:53:22,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:22" (1/1) ... [2025-02-05 10:53:22,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:53:23,388 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/Problem04_label42.c[184279,184292] [2025-02-05 10:53:23,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:53:23,414 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:53:23,770 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/Problem04_label42.c[184279,184292] [2025-02-05 10:53:23,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:53:23,794 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:53:23,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23 WrapperNode [2025-02-05 10:53:23,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:53:23,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:53:23,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:53:23,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:53:23,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:23,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:23,998 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5573 [2025-02-05 10:53:23,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:53:23,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:53:23,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:53:23,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:53:24,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,107 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 10:53:24,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:53:24,297 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:53:24,298 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:53:24,298 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:53:24,299 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (1/1) ... [2025-02-05 10:53:24,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:53:24,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:53:24,331 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 10:53:24,336 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 10:53:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:53:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:53:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:53:24,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:53:24,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:53:24,433 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:53:28,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4081: havoc calculate_output3_#t~ret11#1; [2025-02-05 10:53:28,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1382: havoc calculate_output_#t~ret9#1; [2025-02-05 10:53:28,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719: havoc calculate_output2_#t~ret10#1; [2025-02-05 10:53:28,835 INFO L? ?]: Removed 768 outVars from TransFormulas that were not future-live. [2025-02-05 10:53:28,836 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:53:28,938 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:53:28,938 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:53:28,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:28 BoogieIcfgContainer [2025-02-05 10:53:28,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:53:28,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:53:28,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:53:28,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:53:28,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:53:22" (1/3) ... [2025-02-05 10:53:28,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28344c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:28, skipping insertion in model container [2025-02-05 10:53:28,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:23" (2/3) ... [2025-02-05 10:53:28,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28344c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:28, skipping insertion in model container [2025-02-05 10:53:28,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:28" (3/3) ... [2025-02-05 10:53:28,965 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem04_label42.c [2025-02-05 10:53:28,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:53:29,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem04_label42.c that has 1 procedures, 885 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:53:29,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:53:29,107 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;@7adde0f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:53:29,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:53:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 885 states, 883 states have (on average 1.9218573046432617) internal successors, (1697), 884 states have internal predecessors, (1697), 0 states have call successors, (0), 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 10:53:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2025-02-05 10:53:29,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:29,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:29,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:29,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1067567100, now seen corresponding path program 1 times [2025-02-05 10:53:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513546280] [2025-02-05 10:53:29,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:29,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 814 statements into 1 equivalence classes. [2025-02-05 10:53:29,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 814 of 814 statements. [2025-02-05 10:53:29,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:29,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:32,628 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 10:53:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513546280] [2025-02-05 10:53:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513546280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:32,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998943107] [2025-02-05 10:53:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:32,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:53:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:32,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:53:32,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:53:32,669 INFO L87 Difference]: Start difference. First operand has 885 states, 883 states have (on average 1.9218573046432617) internal successors, (1697), 884 states have internal predecessors, (1697), 0 states have call successors, (0), 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 4 states, 4 states have (on average 203.5) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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 10:53:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:39,318 INFO L93 Difference]: Finished difference Result 4174 states and 8179 transitions. [2025-02-05 10:53:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:53:39,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 203.5) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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 814 [2025-02-05 10:53:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:39,348 INFO L225 Difference]: With dead ends: 4174 [2025-02-05 10:53:39,348 INFO L226 Difference]: Without dead ends: 3219 [2025-02-05 10:53:39,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:53:39,363 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1732 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5220 mSolverCounterSat, 1987 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 7207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1987 IncrementalHoareTripleChecker+Valid, 5220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:39,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 275 Invalid, 7207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1987 Valid, 5220 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-02-05 10:53:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2025-02-05 10:53:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 2458. [2025-02-05 10:53:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2457 states have (on average 1.5474155474155473) internal successors, (3802), 2457 states have internal predecessors, (3802), 0 states have call successors, (0), 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 10:53:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3802 transitions. [2025-02-05 10:53:39,507 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3802 transitions. Word has length 814 [2025-02-05 10:53:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:39,510 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 3802 transitions. [2025-02-05 10:53:39,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 203.5) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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 10:53:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3802 transitions. [2025-02-05 10:53:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-02-05 10:53:39,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:39,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:39,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:53:39,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:39,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash 573733340, now seen corresponding path program 1 times [2025-02-05 10:53:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099447522] [2025-02-05 10:53:39,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:39,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-02-05 10:53:39,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-02-05 10:53:39,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:39,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:53:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:41,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099447522] [2025-02-05 10:53:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099447522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:41,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:41,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:41,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027667141] [2025-02-05 10:53:41,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:41,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:53:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:41,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:53:41,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:53:41,237 INFO L87 Difference]: Start difference. First operand 2458 states and 3802 transitions. Second operand has 4 states, 4 states have (on average 208.25) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 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 10:53:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:46,161 INFO L93 Difference]: Finished difference Result 8186 states and 13540 transitions. [2025-02-05 10:53:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:53:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 208.25) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 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 833 [2025-02-05 10:53:46,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:46,184 INFO L225 Difference]: With dead ends: 8186 [2025-02-05 10:53:46,184 INFO L226 Difference]: Without dead ends: 5730 [2025-02-05 10:53:46,189 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 10:53:46,189 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 1730 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4982 mSolverCounterSat, 1489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 6471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1489 IncrementalHoareTripleChecker+Valid, 4982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:46,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 533 Invalid, 6471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1489 Valid, 4982 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-05 10:53:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2025-02-05 10:53:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5730. [2025-02-05 10:53:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5730 states, 5729 states have (on average 1.4496421714086227) internal successors, (8305), 5729 states have internal predecessors, (8305), 0 states have call successors, (0), 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 10:53:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 8305 transitions. [2025-02-05 10:53:46,305 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 8305 transitions. Word has length 833 [2025-02-05 10:53:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:46,305 INFO L471 AbstractCegarLoop]: Abstraction has 5730 states and 8305 transitions. [2025-02-05 10:53:46,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.25) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 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 10:53:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 8305 transitions. [2025-02-05 10:53:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-05 10:53:46,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:46,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:46,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:53:46,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1970989532, now seen corresponding path program 1 times [2025-02-05 10:53:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70681519] [2025-02-05 10:53:46,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:46,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-05 10:53:46,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-05 10:53:46,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:53:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70681519] [2025-02-05 10:53:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70681519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:53:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397296817] [2025-02-05 10:53:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:47,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:47,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:47,051 INFO L87 Difference]: Start difference. First operand 5730 states and 8305 transitions. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 2 states have internal predecessors, (832), 0 states have call successors, (0), 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 10:53:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:49,852 INFO L93 Difference]: Finished difference Result 16366 states and 24080 transitions. [2025-02-05 10:53:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:49,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 2 states have internal predecessors, (832), 0 states have call successors, (0), 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 838 [2025-02-05 10:53:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:49,880 INFO L225 Difference]: With dead ends: 16366 [2025-02-05 10:53:49,880 INFO L226 Difference]: Without dead ends: 10638 [2025-02-05 10:53:49,890 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 10:53:49,891 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 985 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:49,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 499 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 10:53:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10638 states. [2025-02-05 10:53:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10638 to 10638. [2025-02-05 10:53:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10638 states, 10637 states have (on average 1.3346808310613896) internal successors, (14197), 10637 states have internal predecessors, (14197), 0 states have call successors, (0), 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 10:53:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10638 states to 10638 states and 14197 transitions. [2025-02-05 10:53:50,110 INFO L78 Accepts]: Start accepts. Automaton has 10638 states and 14197 transitions. Word has length 838 [2025-02-05 10:53:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 10638 states and 14197 transitions. [2025-02-05 10:53:50,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 2 states have internal predecessors, (832), 0 states have call successors, (0), 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 10:53:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 10638 states and 14197 transitions. [2025-02-05 10:53:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2025-02-05 10:53:50,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:50,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:50,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:53:50,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:50,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1955027403, now seen corresponding path program 1 times [2025-02-05 10:53:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773834773] [2025-02-05 10:53:50,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:50,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 847 statements into 1 equivalence classes. [2025-02-05 10:53:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 847 of 847 statements. [2025-02-05 10:53:50,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:53:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773834773] [2025-02-05 10:53:50,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773834773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:53:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277166622] [2025-02-05 10:53:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:50,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:50,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:50,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:50,948 INFO L87 Difference]: Start difference. First operand 10638 states and 14197 transitions. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 2 states have internal predecessors, (838), 0 states have call successors, (0), 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 10:53:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:53,592 INFO L93 Difference]: Finished difference Result 24546 states and 33525 transitions. [2025-02-05 10:53:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:53,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 2 states have internal predecessors, (838), 0 states have call successors, (0), 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 847 [2025-02-05 10:53:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:53,626 INFO L225 Difference]: With dead ends: 24546 [2025-02-05 10:53:53,626 INFO L226 Difference]: Without dead ends: 13910 [2025-02-05 10:53:53,638 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 10:53:53,638 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 978 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1166 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:53,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 211 Invalid, 3446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1166 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 10:53:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13910 states. [2025-02-05 10:53:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13910 to 13910. [2025-02-05 10:53:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13910 states, 13909 states have (on average 1.336257099719606) internal successors, (18586), 13909 states have internal predecessors, (18586), 0 states have call successors, (0), 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 10:53:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13910 states to 13910 states and 18586 transitions. [2025-02-05 10:53:53,863 INFO L78 Accepts]: Start accepts. Automaton has 13910 states and 18586 transitions. Word has length 847 [2025-02-05 10:53:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:53,864 INFO L471 AbstractCegarLoop]: Abstraction has 13910 states and 18586 transitions. [2025-02-05 10:53:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 2 states have internal predecessors, (838), 0 states have call successors, (0), 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 10:53:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13910 states and 18586 transitions. [2025-02-05 10:53:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2025-02-05 10:53:53,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:53,899 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:53,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:53:53,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:53,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1324533538, now seen corresponding path program 1 times [2025-02-05 10:53:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744169839] [2025-02-05 10:53:53,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:53,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:54,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 914 statements into 1 equivalence classes. [2025-02-05 10:53:54,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 914 of 914 statements. [2025-02-05 10:53:54,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:54,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:53:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744169839] [2025-02-05 10:53:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744169839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:54,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:54,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603086666] [2025-02-05 10:53:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:54,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:54,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:54,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:54,603 INFO L87 Difference]: Start difference. First operand 13910 states and 18586 transitions. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 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 10:53:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:57,257 INFO L93 Difference]: Finished difference Result 40906 states and 54923 transitions. [2025-02-05 10:53:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 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 914 [2025-02-05 10:53:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:57,312 INFO L225 Difference]: With dead ends: 40906 [2025-02-05 10:53:57,312 INFO L226 Difference]: Without dead ends: 26998 [2025-02-05 10:53:57,326 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 10:53:57,327 INFO L435 NwaCegarLoop]: 1438 mSDtfsCounter, 755 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:57,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1447 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 10:53:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26998 states. [2025-02-05 10:53:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26998 to 26998. [2025-02-05 10:53:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26998 states, 26997 states have (on average 1.2952550283364819) internal successors, (34968), 26997 states have internal predecessors, (34968), 0 states have call successors, (0), 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 10:53:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26998 states to 26998 states and 34968 transitions. [2025-02-05 10:53:57,623 INFO L78 Accepts]: Start accepts. Automaton has 26998 states and 34968 transitions. Word has length 914 [2025-02-05 10:53:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 26998 states and 34968 transitions. [2025-02-05 10:53:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 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 10:53:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 26998 states and 34968 transitions. [2025-02-05 10:53:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2025-02-05 10:53:57,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:57,672 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:57,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:53:57,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1545788964, now seen corresponding path program 1 times [2025-02-05 10:53:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:57,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778824146] [2025-02-05 10:53:57,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:57,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 966 statements into 1 equivalence classes. [2025-02-05 10:53:57,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 966 of 966 statements. [2025-02-05 10:53:57,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:57,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:53:58,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778824146] [2025-02-05 10:53:58,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778824146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:58,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:58,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:58,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876524097] [2025-02-05 10:53:58,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:58,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:58,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:58,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:58,431 INFO L87 Difference]: Start difference. First operand 26998 states and 34968 transitions. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 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 10:54:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:00,696 INFO L93 Difference]: Finished difference Result 53994 states and 69934 transitions. [2025-02-05 10:54:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:00,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 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 966 [2025-02-05 10:54:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:00,747 INFO L225 Difference]: With dead ends: 53994 [2025-02-05 10:54:00,747 INFO L226 Difference]: Without dead ends: 26998 [2025-02-05 10:54:00,868 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 10:54:00,871 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 838 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:00,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1130 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 10:54:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26998 states. [2025-02-05 10:54:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26998 to 26998. [2025-02-05 10:54:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26998 states, 26997 states have (on average 1.248953587435641) internal successors, (33718), 26997 states have internal predecessors, (33718), 0 states have call successors, (0), 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 10:54:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26998 states to 26998 states and 33718 transitions. [2025-02-05 10:54:01,166 INFO L78 Accepts]: Start accepts. Automaton has 26998 states and 33718 transitions. Word has length 966 [2025-02-05 10:54:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:01,168 INFO L471 AbstractCegarLoop]: Abstraction has 26998 states and 33718 transitions. [2025-02-05 10:54:01,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 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 10:54:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 26998 states and 33718 transitions. [2025-02-05 10:54:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2025-02-05 10:54:01,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:01,203 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:01,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:54:01,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:01,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2004209631, now seen corresponding path program 1 times [2025-02-05 10:54:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017430561] [2025-02-05 10:54:01,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:01,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 993 statements into 1 equivalence classes. [2025-02-05 10:54:01,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 993 of 993 statements. [2025-02-05 10:54:01,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:01,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 10:54:01,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:01,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017430561] [2025-02-05 10:54:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017430561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:01,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:54:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039114008] [2025-02-05 10:54:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:01,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:01,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:01,669 INFO L87 Difference]: Start difference. First operand 26998 states and 33718 transitions. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 2 states have internal predecessors, (959), 0 states have call successors, (0), 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 10:54:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:04,289 INFO L93 Difference]: Finished difference Result 76898 states and 96615 transitions. [2025-02-05 10:54:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:04,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 2 states have internal predecessors, (959), 0 states have call successors, (0), 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 993 [2025-02-05 10:54:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:04,384 INFO L225 Difference]: With dead ends: 76898 [2025-02-05 10:54:04,384 INFO L226 Difference]: Without dead ends: 49902 [2025-02-05 10:54:04,414 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 10:54:04,415 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 879 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 552 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1063 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 10:54:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49902 states. [2025-02-05 10:54:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49902 to 38450. [2025-02-05 10:54:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38450 states, 38449 states have (on average 1.216962729849931) internal successors, (46791), 38449 states have internal predecessors, (46791), 0 states have call successors, (0), 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 10:54:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38450 states to 38450 states and 46791 transitions. [2025-02-05 10:54:04,885 INFO L78 Accepts]: Start accepts. Automaton has 38450 states and 46791 transitions. Word has length 993 [2025-02-05 10:54:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:04,886 INFO L471 AbstractCegarLoop]: Abstraction has 38450 states and 46791 transitions. [2025-02-05 10:54:04,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 2 states have internal predecessors, (959), 0 states have call successors, (0), 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 10:54:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 38450 states and 46791 transitions. [2025-02-05 10:54:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2025-02-05 10:54:04,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:04,925 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:04,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:54:04,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1093969589, now seen corresponding path program 1 times [2025-02-05 10:54:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175572786] [2025-02-05 10:54:04,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:05,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1039 statements into 1 equivalence classes. [2025-02-05 10:54:05,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1039 of 1039 statements. [2025-02-05 10:54:05,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-02-05 10:54:05,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:05,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175572786] [2025-02-05 10:54:05,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175572786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:05,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:05,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:54:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570376726] [2025-02-05 10:54:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:05,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:05,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:05,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:05,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:05,553 INFO L87 Difference]: Start difference. First operand 38450 states and 46791 transitions. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 2 states have internal predecessors, (865), 0 states have call successors, (0), 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 10:54:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:08,125 INFO L93 Difference]: Finished difference Result 98984 states and 119422 transitions. [2025-02-05 10:54:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 2 states have internal predecessors, (865), 0 states have call successors, (0), 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 1039 [2025-02-05 10:54:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:08,215 INFO L225 Difference]: With dead ends: 98984 [2025-02-05 10:54:08,215 INFO L226 Difference]: Without dead ends: 60536 [2025-02-05 10:54:08,244 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 10:54:08,244 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 987 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 999 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:08,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 317 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [999 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 10:54:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60536 states. [2025-02-05 10:54:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60536 to 58900. [2025-02-05 10:54:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58900 states, 58899 states have (on average 1.1449939727329836) internal successors, (67439), 58899 states have internal predecessors, (67439), 0 states have call successors, (0), 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 10:54:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58900 states to 58900 states and 67439 transitions. [2025-02-05 10:54:08,788 INFO L78 Accepts]: Start accepts. Automaton has 58900 states and 67439 transitions. Word has length 1039 [2025-02-05 10:54:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 58900 states and 67439 transitions. [2025-02-05 10:54:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 2 states have internal predecessors, (865), 0 states have call successors, (0), 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 10:54:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 58900 states and 67439 transitions. [2025-02-05 10:54:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2025-02-05 10:54:08,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:08,838 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:08,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:54:08,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:08,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1054945135, now seen corresponding path program 1 times [2025-02-05 10:54:08,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:08,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986007705] [2025-02-05 10:54:08,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:08,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:08,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-02-05 10:54:08,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-02-05 10:54:08,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:08,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-02-05 10:54:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986007705] [2025-02-05 10:54:09,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986007705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:54:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981951657] [2025-02-05 10:54:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:09,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:09,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:09,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:09,978 INFO L87 Difference]: Start difference. First operand 58900 states and 67439 transitions. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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 10:54:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:12,316 INFO L93 Difference]: Finished difference Result 118616 states and 135724 transitions. [2025-02-05 10:54:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:12,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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 1185 [2025-02-05 10:54:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:12,388 INFO L225 Difference]: With dead ends: 118616 [2025-02-05 10:54:12,388 INFO L226 Difference]: Without dead ends: 59718 [2025-02-05 10:54:12,436 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 10:54:12,436 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 824 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:12,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 669 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 10:54:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59718 states. [2025-02-05 10:54:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59718 to 59718. [2025-02-05 10:54:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59718 states, 59717 states have (on average 1.1415007451814392) internal successors, (68167), 59717 states have internal predecessors, (68167), 0 states have call successors, (0), 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 10:54:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59718 states to 59718 states and 68167 transitions. [2025-02-05 10:54:12,977 INFO L78 Accepts]: Start accepts. Automaton has 59718 states and 68167 transitions. Word has length 1185 [2025-02-05 10:54:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:12,977 INFO L471 AbstractCegarLoop]: Abstraction has 59718 states and 68167 transitions. [2025-02-05 10:54:12,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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 10:54:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 59718 states and 68167 transitions. [2025-02-05 10:54:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1227 [2025-02-05 10:54:13,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:13,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:13,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:54:13,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:13,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1462317445, now seen corresponding path program 1 times [2025-02-05 10:54:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655892605] [2025-02-05 10:54:13,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:13,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1226 statements into 1 equivalence classes. [2025-02-05 10:54:13,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1226 of 1226 statements. [2025-02-05 10:54:13,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:13,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-05 10:54:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655892605] [2025-02-05 10:54:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655892605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:54:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432414787] [2025-02-05 10:54:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:13,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:13,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:13,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:13,683 INFO L87 Difference]: Start difference. First operand 59718 states and 68167 transitions. Second operand has 3 states, 3 states have (on average 347.3333333333333) internal successors, (1042), 3 states have internal predecessors, (1042), 0 states have call successors, (0), 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 10:54:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:16,332 INFO L93 Difference]: Finished difference Result 134976 states and 154954 transitions. [2025-02-05 10:54:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:16,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 347.3333333333333) internal successors, (1042), 3 states have internal predecessors, (1042), 0 states have call successors, (0), 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 1226 [2025-02-05 10:54:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:16,420 INFO L225 Difference]: With dead ends: 134976 [2025-02-05 10:54:16,421 INFO L226 Difference]: Without dead ends: 75260 [2025-02-05 10:54:16,468 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 10:54:16,469 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 923 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 960 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 960 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:16,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 403 Invalid, 3221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [960 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 10:54:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75260 states. [2025-02-05 10:54:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75260 to 74442. [2025-02-05 10:54:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74442 states, 74441 states have (on average 1.1335016993323572) internal successors, (84379), 74441 states have internal predecessors, (84379), 0 states have call successors, (0), 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 10:54:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74442 states to 74442 states and 84379 transitions. [2025-02-05 10:54:17,295 INFO L78 Accepts]: Start accepts. Automaton has 74442 states and 84379 transitions. Word has length 1226 [2025-02-05 10:54:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:17,295 INFO L471 AbstractCegarLoop]: Abstraction has 74442 states and 84379 transitions. [2025-02-05 10:54:17,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 347.3333333333333) internal successors, (1042), 3 states have internal predecessors, (1042), 0 states have call successors, (0), 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 10:54:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 74442 states and 84379 transitions. [2025-02-05 10:54:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1320 [2025-02-05 10:54:17,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:17,471 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:17,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:54:17,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:17,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1454768083, now seen corresponding path program 1 times [2025-02-05 10:54:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:17,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751628623] [2025-02-05 10:54:17,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:17,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1319 statements into 1 equivalence classes. [2025-02-05 10:54:17,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1319 of 1319 statements. [2025-02-05 10:54:17,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:17,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-02-05 10:54:18,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:18,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751628623] [2025-02-05 10:54:18,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751628623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:18,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:18,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:54:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963378284] [2025-02-05 10:54:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:18,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:18,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:18,248 INFO L87 Difference]: Start difference. First operand 74442 states and 84379 transitions. Second operand has 3 states, 3 states have (on average 403.0) internal successors, (1209), 3 states have internal predecessors, (1209), 0 states have call successors, (0), 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 10:54:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:20,946 INFO L93 Difference]: Finished difference Result 148882 states and 168756 transitions. [2025-02-05 10:54:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 403.0) internal successors, (1209), 3 states have internal predecessors, (1209), 0 states have call successors, (0), 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 1319 [2025-02-05 10:54:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:21,037 INFO L225 Difference]: With dead ends: 148882 [2025-02-05 10:54:21,037 INFO L226 Difference]: Without dead ends: 74442 [2025-02-05 10:54:21,084 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 10:54:21,085 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 786 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:21,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1364 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 10:54:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74442 states. [2025-02-05 10:54:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74442 to 72806. [2025-02-05 10:54:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72806 states, 72805 states have (on average 1.0979328342833596) internal successors, (79935), 72805 states have internal predecessors, (79935), 0 states have call successors, (0), 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 10:54:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72806 states to 72806 states and 79935 transitions. [2025-02-05 10:54:21,961 INFO L78 Accepts]: Start accepts. Automaton has 72806 states and 79935 transitions. Word has length 1319 [2025-02-05 10:54:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 72806 states and 79935 transitions. [2025-02-05 10:54:21,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.0) internal successors, (1209), 3 states have internal predecessors, (1209), 0 states have call successors, (0), 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 10:54:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 72806 states and 79935 transitions. [2025-02-05 10:54:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1442 [2025-02-05 10:54:22,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:22,023 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:22,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:54:22,023 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:22,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:22,024 INFO L85 PathProgramCache]: Analyzing trace with hash 770282552, now seen corresponding path program 1 times [2025-02-05 10:54:22,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:22,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528294835] [2025-02-05 10:54:22,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:22,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1441 statements into 1 equivalence classes. [2025-02-05 10:54:22,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1441 of 1441 statements. [2025-02-05 10:54:22,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:22,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-02-05 10:54:23,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:23,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528294835] [2025-02-05 10:54:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528294835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:23,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:54:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146736233] [2025-02-05 10:54:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:23,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:23,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:23,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:23,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:23,156 INFO L87 Difference]: Start difference. First operand 72806 states and 79935 transitions. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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 10:54:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:25,393 INFO L93 Difference]: Finished difference Result 153790 states and 168384 transitions. [2025-02-05 10:54:25,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:25,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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 1441 [2025-02-05 10:54:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:25,471 INFO L225 Difference]: With dead ends: 153790 [2025-02-05 10:54:25,471 INFO L226 Difference]: Without dead ends: 77714 [2025-02-05 10:54:25,514 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 10:54:25,514 INFO L435 NwaCegarLoop]: 1403 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:25,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1411 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 10:54:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77714 states. [2025-02-05 10:54:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77714 to 70352. [2025-02-05 10:54:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70352 states, 70351 states have (on average 1.0841494790408097) internal successors, (76271), 70351 states have internal predecessors, (76271), 0 states have call successors, (0), 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 10:54:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70352 states to 70352 states and 76271 transitions. [2025-02-05 10:54:26,472 INFO L78 Accepts]: Start accepts. Automaton has 70352 states and 76271 transitions. Word has length 1441 [2025-02-05 10:54:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:26,473 INFO L471 AbstractCegarLoop]: Abstraction has 70352 states and 76271 transitions. [2025-02-05 10:54:26,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 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 10:54:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 70352 states and 76271 transitions. [2025-02-05 10:54:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1521 [2025-02-05 10:54:26,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:26,672 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:26,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:54:26,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -388499505, now seen corresponding path program 1 times [2025-02-05 10:54:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984897038] [2025-02-05 10:54:26,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:26,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1520 statements into 1 equivalence classes. [2025-02-05 10:54:26,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1520 of 1520 statements. [2025-02-05 10:54:26,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:26,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-02-05 10:54:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984897038] [2025-02-05 10:54:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984897038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:28,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:54:28,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:54:28,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813499147] [2025-02-05 10:54:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:28,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:28,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:28,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:54:28,503 INFO L87 Difference]: Start difference. First operand 70352 states and 76271 transitions. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 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 10:54:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:54:30,756 INFO L93 Difference]: Finished difference Result 148064 states and 160478 transitions. [2025-02-05 10:54:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:54:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 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 1520 [2025-02-05 10:54:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:54:30,835 INFO L225 Difference]: With dead ends: 148064 [2025-02-05 10:54:30,835 INFO L226 Difference]: Without dead ends: 77714 [2025-02-05 10:54:30,881 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 10:54:30,882 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 416 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:54:30,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 732 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 10:54:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77714 states. [2025-02-05 10:54:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77714 to 77714. [2025-02-05 10:54:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77714 states, 77713 states have (on average 1.0793689601482377) internal successors, (83881), 77713 states have internal predecessors, (83881), 0 states have call successors, (0), 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 10:54:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77714 states to 77714 states and 83881 transitions. [2025-02-05 10:54:31,808 INFO L78 Accepts]: Start accepts. Automaton has 77714 states and 83881 transitions. Word has length 1520 [2025-02-05 10:54:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:54:31,809 INFO L471 AbstractCegarLoop]: Abstraction has 77714 states and 83881 transitions. [2025-02-05 10:54:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 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 10:54:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77714 states and 83881 transitions. [2025-02-05 10:54:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2025-02-05 10:54:31,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:54:31,855 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:54:31,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:54:31,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:54:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:54:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 531113900, now seen corresponding path program 1 times [2025-02-05 10:54:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:54:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379856262] [2025-02-05 10:54:31,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:54:31,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1584 statements into 1 equivalence classes. [2025-02-05 10:54:31,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1584 of 1584 statements. [2025-02-05 10:54:31,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:31,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 1424 proven. 89 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-02-05 10:54:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:54:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379856262] [2025-02-05 10:54:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379856262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:54:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736727832] [2025-02-05 10:54:33,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:54:33,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:54:33,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:54:33,890 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 10:54:33,891 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 10:54:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1584 statements into 1 equivalence classes. [2025-02-05 10:54:34,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1584 of 1584 statements. [2025-02-05 10:54:34,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:54:34,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:54:34,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:54:34,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:54:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 1462 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-02-05 10:54:34,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:54:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736727832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:54:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:54:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 10:54:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520167211] [2025-02-05 10:54:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:54:34,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:54:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:54:34,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:54:34,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:54:34,768 INFO L87 Difference]: Start difference. First operand 77714 states and 83881 transitions. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)