./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label38.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e22f4e480e00059ce3613278d58ea2e0a6d73a8e3bda2e3d0eda9cb576504b9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:10:35,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:10:35,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:10:35,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:10:35,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:10:35,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:10:35,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:10:35,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:10:35,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:10:35,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:10:35,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:10:35,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:10:35,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:10:35,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:10:35,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:10:35,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:10:35,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:10:35,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:10:35,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:10:35,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:10:35,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:35,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:10:35,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:10:35,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e22f4e480e00059ce3613278d58ea2e0a6d73a8e3bda2e3d0eda9cb576504b9d [2025-03-08 02:10:36,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:10:36,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:10:36,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:10:36,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:10:36,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:10:36,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label38.c [2025-03-08 02:10:37,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ed57a10/dca36686a00945018c648c51bce5c919/FLAG3eb251001 [2025-03-08 02:10:37,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:10:37,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label38.c [2025-03-08 02:10:37,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ed57a10/dca36686a00945018c648c51bce5c919/FLAG3eb251001 [2025-03-08 02:10:37,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ed57a10/dca36686a00945018c648c51bce5c919 [2025-03-08 02:10:37,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:10:37,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:10:37,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:37,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:10:37,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:10:37,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:37" (1/1) ... [2025-03-08 02:10:37,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:37, skipping insertion in model container [2025-03-08 02:10:37,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:37" (1/1) ... [2025-03-08 02:10:37,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:10:37,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label38.c[7744,7757] [2025-03-08 02:10:38,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:38,272 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:10:38,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label38.c[7744,7757] [2025-03-08 02:10:38,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:38,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:10:38,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38 WrapperNode [2025-03-08 02:10:38,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:38,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:38,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:10:38,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:10:38,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:38,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:38,685 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:10:38,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:38,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:10:38,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:10:38,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:10:38,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:38,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:38,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:38,881 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:10:38,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:38,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:39,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:39,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:39,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:39,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:39,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:10:39,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:10:39,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:10:39,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:10:39,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (1/1) ... [2025-03-08 02:10:39,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:39,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:39,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:10:39,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:10:39,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:10:39,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:10:39,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:10:39,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:10:39,185 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:10:39,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:10:41,626 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:10:41,728 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:10:41,729 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:10:41,755 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:10:41,757 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:10:41,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:41 BoogieIcfgContainer [2025-03-08 02:10:41,758 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:10:41,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:10:41,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:10:41,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:10:41,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:10:37" (1/3) ... [2025-03-08 02:10:41,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd11f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:41, skipping insertion in model container [2025-03-08 02:10:41,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:38" (2/3) ... [2025-03-08 02:10:41,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd11f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:41, skipping insertion in model container [2025-03-08 02:10:41,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:41" (3/3) ... [2025-03-08 02:10:41,765 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label38.c [2025-03-08 02:10:41,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:10:41,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label38.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:10:41,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:10:41,854 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;@66191023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:10:41,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:10:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 02:10:41,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:41,866 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] [2025-03-08 02:10:41,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1251988935, now seen corresponding path program 1 times [2025-03-08 02:10:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642152040] [2025-03-08 02:10:41,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:41,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 02:10:41,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 02:10:41,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:41,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:42,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642152040] [2025-03-08 02:10:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642152040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:42,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348277545] [2025-03-08 02:10:42,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:42,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:42,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:42,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:42,182 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:44,096 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-08 02:10:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:44,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-08 02:10:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:44,111 INFO L225 Difference]: With dead ends: 1642 [2025-03-08 02:10:44,112 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 02:10:44,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:44,117 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 438 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:44,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:10:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 02:10:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-08 02:10:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-08 02:10:44,181 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 52 [2025-03-08 02:10:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:44,182 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-08 02:10:44,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-08 02:10:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 02:10:44,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:44,186 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:44,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:10:44,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:44,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash -487646431, now seen corresponding path program 1 times [2025-03-08 02:10:44,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874941175] [2025-03-08 02:10:44,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:44,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 02:10:44,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 02:10:44,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:44,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874941175] [2025-03-08 02:10:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874941175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033485386] [2025-03-08 02:10:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:44,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:44,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:44,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:44,517 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:46,387 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-03-08 02:10:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-08 02:10:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:46,394 INFO L225 Difference]: With dead ends: 2814 [2025-03-08 02:10:46,394 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:10:46,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:46,397 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 439 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:10:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:10:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-03-08 02:10:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-03-08 02:10:46,437 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 122 [2025-03-08 02:10:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:46,439 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-03-08 02:10:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-03-08 02:10:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 02:10:46,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:46,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:46,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:10:46,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:46,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1300438038, now seen corresponding path program 1 times [2025-03-08 02:10:46,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:46,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126048202] [2025-03-08 02:10:46,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:46,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 02:10:46,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 02:10:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126048202] [2025-03-08 02:10:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126048202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074508448] [2025-03-08 02:10:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:46,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:46,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:46,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:46,643 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:48,188 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-03-08 02:10:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-03-08 02:10:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:48,200 INFO L225 Difference]: With dead ends: 5395 [2025-03-08 02:10:48,200 INFO L226 Difference]: Without dead ends: 2701 [2025-03-08 02:10:48,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:48,203 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:48,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:10:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-08 02:10:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-03-08 02:10:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-03-08 02:10:48,238 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 144 [2025-03-08 02:10:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:48,238 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-03-08 02:10:48,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-03-08 02:10:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 02:10:48,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:48,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:48,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:10:48,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 903457182, now seen corresponding path program 1 times [2025-03-08 02:10:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666200870] [2025-03-08 02:10:48,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:48,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 02:10:48,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 02:10:48,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:48,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:48,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666200870] [2025-03-08 02:10:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666200870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:48,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101535372] [2025-03-08 02:10:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:48,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:48,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:48,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:48,476 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:49,866 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-03-08 02:10:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:49,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-03-08 02:10:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:49,885 INFO L225 Difference]: With dead ends: 7108 [2025-03-08 02:10:49,885 INFO L226 Difference]: Without dead ends: 4409 [2025-03-08 02:10:49,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:49,888 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:49,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-08 02:10:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-03-08 02:10:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-03-08 02:10:49,941 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 204 [2025-03-08 02:10:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-03-08 02:10:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-03-08 02:10:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 02:10:49,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:49,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:49,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:10:49,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1688590023, now seen corresponding path program 1 times [2025-03-08 02:10:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037350228] [2025-03-08 02:10:49,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:49,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 02:10:49,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 02:10:49,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:49,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:10:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037350228] [2025-03-08 02:10:50,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037350228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:50,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:50,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:50,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686387435] [2025-03-08 02:10:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:50,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:50,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:50,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:50,052 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:51,353 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-03-08 02:10:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:51,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 206 [2025-03-08 02:10:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:51,368 INFO L225 Difference]: With dead ends: 10936 [2025-03-08 02:10:51,368 INFO L226 Difference]: Without dead ends: 6528 [2025-03-08 02:10:51,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:51,374 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 399 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:51,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:10:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-03-08 02:10:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-03-08 02:10:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-03-08 02:10:51,441 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 206 [2025-03-08 02:10:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:51,441 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-03-08 02:10:51,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-03-08 02:10:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 02:10:51,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:51,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:10:51,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -752292031, now seen corresponding path program 1 times [2025-03-08 02:10:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277952310] [2025-03-08 02:10:51,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:51,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 02:10:51,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 02:10:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:51,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 99 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277952310] [2025-03-08 02:10:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277952310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261782836] [2025-03-08 02:10:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:51,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:10:51,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:10:51,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 02:10:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 02:10:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:51,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:51,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:10:51,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 99 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:52,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:10:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261782836] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:10:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2025-03-08 02:10:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119063413] [2025-03-08 02:10:52,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:52,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:52,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:10:52,532 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:55,036 INFO L93 Difference]: Finished difference Result 16039 states and 18798 transitions. [2025-03-08 02:10:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-03-08 02:10:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:55,057 INFO L225 Difference]: With dead ends: 16039 [2025-03-08 02:10:55,057 INFO L226 Difference]: Without dead ends: 10804 [2025-03-08 02:10:55,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:10:55,061 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 767 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:55,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 154 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 02:10:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2025-03-08 02:10:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 9924. [2025-03-08 02:10:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9924 states, 9923 states have (on average 1.1542880177365715) internal successors, (11454), 9923 states have internal predecessors, (11454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9924 states to 9924 states and 11454 transitions. [2025-03-08 02:10:55,183 INFO L78 Accepts]: Start accepts. Automaton has 9924 states and 11454 transitions. Word has length 272 [2025-03-08 02:10:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:55,184 INFO L471 AbstractCegarLoop]: Abstraction has 9924 states and 11454 transitions. [2025-03-08 02:10:55,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9924 states and 11454 transitions. [2025-03-08 02:10:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 02:10:55,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:55,187 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:55,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:10:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 02:10:55,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:55,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1969624090, now seen corresponding path program 1 times [2025-03-08 02:10:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963541994] [2025-03-08 02:10:55,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:55,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 02:10:55,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 02:10:55,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:55,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:10:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963541994] [2025-03-08 02:10:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963541994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:55,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774938632] [2025-03-08 02:10:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:55,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:55,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:55,565 INFO L87 Difference]: Start difference. First operand 9924 states and 11454 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:56,878 INFO L93 Difference]: Finished difference Result 24946 states and 29142 transitions. [2025-03-08 02:10:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2025-03-08 02:10:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:56,913 INFO L225 Difference]: With dead ends: 24946 [2025-03-08 02:10:56,913 INFO L226 Difference]: Without dead ends: 14174 [2025-03-08 02:10:56,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:56,923 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 367 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:56,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 830 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:10:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14174 states. [2025-03-08 02:10:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14174 to 14174. [2025-03-08 02:10:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14174 states, 14173 states have (on average 1.1241797784519862) internal successors, (15933), 14173 states have internal predecessors, (15933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14174 states to 14174 states and 15933 transitions. [2025-03-08 02:10:57,081 INFO L78 Accepts]: Start accepts. Automaton has 14174 states and 15933 transitions. Word has length 301 [2025-03-08 02:10:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:57,082 INFO L471 AbstractCegarLoop]: Abstraction has 14174 states and 15933 transitions. [2025-03-08 02:10:57,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 14174 states and 15933 transitions. [2025-03-08 02:10:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 02:10:57,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:57,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:57,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:10:57,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:57,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash 890843967, now seen corresponding path program 1 times [2025-03-08 02:10:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:57,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392761664] [2025-03-08 02:10:57,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:57,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 02:10:57,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 02:10:57,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:57,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:10:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392761664] [2025-03-08 02:10:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392761664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004535724] [2025-03-08 02:10:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:57,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:57,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:57,294 INFO L87 Difference]: Start difference. First operand 14174 states and 15933 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:58,692 INFO L93 Difference]: Finished difference Result 34303 states and 38905 transitions. [2025-03-08 02:10:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:58,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 324 [2025-03-08 02:10:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:58,729 INFO L225 Difference]: With dead ends: 34303 [2025-03-08 02:10:58,729 INFO L226 Difference]: Without dead ends: 20131 [2025-03-08 02:10:58,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:58,742 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 444 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:58,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 349 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-03-08 02:10:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 18000. [2025-03-08 02:10:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18000 states, 17999 states have (on average 1.1273404078004334) internal successors, (20291), 17999 states have internal predecessors, (20291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18000 states to 18000 states and 20291 transitions. [2025-03-08 02:10:58,928 INFO L78 Accepts]: Start accepts. Automaton has 18000 states and 20291 transitions. Word has length 324 [2025-03-08 02:10:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:58,928 INFO L471 AbstractCegarLoop]: Abstraction has 18000 states and 20291 transitions. [2025-03-08 02:10:58,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18000 states and 20291 transitions. [2025-03-08 02:10:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 02:10:58,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:58,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:58,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:10:58,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:58,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1549102526, now seen corresponding path program 1 times [2025-03-08 02:10:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:58,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807466667] [2025-03-08 02:10:58,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:58,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:58,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 02:10:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 02:10:59,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:59,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807466667] [2025-03-08 02:10:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807466667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:59,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:59,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177389536] [2025-03-08 02:10:59,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:59,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:59,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:59,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:59,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:59,329 INFO L87 Difference]: Start difference. First operand 18000 states and 20291 transitions. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:01,209 INFO L93 Difference]: Finished difference Result 45822 states and 51419 transitions. [2025-03-08 02:11:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 391 [2025-03-08 02:11:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:01,246 INFO L225 Difference]: With dead ends: 45822 [2025-03-08 02:11:01,247 INFO L226 Difference]: Without dead ends: 26973 [2025-03-08 02:11:01,263 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-03-08 02:11:01,264 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 523 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:01,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 426 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:11:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26973 states. [2025-03-08 02:11:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26973 to 24819. [2025-03-08 02:11:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24819 states, 24818 states have (on average 1.120557659763075) internal successors, (27810), 24818 states have internal predecessors, (27810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24819 states to 24819 states and 27810 transitions. [2025-03-08 02:11:01,528 INFO L78 Accepts]: Start accepts. Automaton has 24819 states and 27810 transitions. Word has length 391 [2025-03-08 02:11:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:01,529 INFO L471 AbstractCegarLoop]: Abstraction has 24819 states and 27810 transitions. [2025-03-08 02:11:01,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 24819 states and 27810 transitions. [2025-03-08 02:11:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-08 02:11:01,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:01,541 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:01,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:11:01,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:01,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1860346684, now seen corresponding path program 1 times [2025-03-08 02:11:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419985455] [2025-03-08 02:11:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:01,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-08 02:11:01,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-08 02:11:01,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:01,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:11:02,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419985455] [2025-03-08 02:11:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419985455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:02,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:02,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:02,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753587853] [2025-03-08 02:11:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:02,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:02,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:02,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:02,039 INFO L87 Difference]: Start difference. First operand 24819 states and 27810 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:03,373 INFO L93 Difference]: Finished difference Result 56883 states and 63708 transitions. [2025-03-08 02:11:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 487 [2025-03-08 02:11:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:03,412 INFO L225 Difference]: With dead ends: 56883 [2025-03-08 02:11:03,412 INFO L226 Difference]: Without dead ends: 32066 [2025-03-08 02:11:03,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:03,431 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 466 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:03,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 169 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32066 states. [2025-03-08 02:11:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32066 to 28646. [2025-03-08 02:11:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28646 states, 28645 states have (on average 1.1261302146971548) internal successors, (32258), 28645 states have internal predecessors, (32258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28646 states to 28646 states and 32258 transitions. [2025-03-08 02:11:03,847 INFO L78 Accepts]: Start accepts. Automaton has 28646 states and 32258 transitions. Word has length 487 [2025-03-08 02:11:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:03,852 INFO L471 AbstractCegarLoop]: Abstraction has 28646 states and 32258 transitions. [2025-03-08 02:11:03,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 28646 states and 32258 transitions. [2025-03-08 02:11:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 02:11:03,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:03,867 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:11:03,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1477553483, now seen corresponding path program 1 times [2025-03-08 02:11:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523766319] [2025-03-08 02:11:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:03,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 02:11:03,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 02:11:03,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:03,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 367 proven. 82 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 02:11:04,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523766319] [2025-03-08 02:11:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523766319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917632885] [2025-03-08 02:11:04,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:04,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:04,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:04,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:11:04,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:11:04,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 02:11:04,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 02:11:04,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:04,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:11:04,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 335 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:04,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:11:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917632885] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:11:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-03-08 02:11:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663253659] [2025-03-08 02:11:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:05,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:11:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:05,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:11:05,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:05,404 INFO L87 Difference]: Start difference. First operand 28646 states and 32258 transitions. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:08,273 INFO L93 Difference]: Finished difference Result 89664 states and 101556 transitions. [2025-03-08 02:11:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:11:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 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 576 [2025-03-08 02:11:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:08,343 INFO L225 Difference]: With dead ends: 89664 [2025-03-08 02:11:08,343 INFO L226 Difference]: Without dead ends: 58461 [2025-03-08 02:11:08,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1153 GetRequests, 1147 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:11:08,359 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1032 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:08,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 221 Invalid, 4029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 02:11:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58461 states. [2025-03-08 02:11:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58461 to 57601. [2025-03-08 02:11:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57601 states, 57600 states have (on average 1.1174305555555555) internal successors, (64364), 57600 states have internal predecessors, (64364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57601 states to 57601 states and 64364 transitions. [2025-03-08 02:11:09,065 INFO L78 Accepts]: Start accepts. Automaton has 57601 states and 64364 transitions. Word has length 576 [2025-03-08 02:11:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:09,065 INFO L471 AbstractCegarLoop]: Abstraction has 57601 states and 64364 transitions. [2025-03-08 02:11:09,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 57601 states and 64364 transitions. [2025-03-08 02:11:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-08 02:11:09,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:09,090 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:09,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:11:09,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 02:11:09,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:09,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1246355261, now seen corresponding path program 1 times [2025-03-08 02:11:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383134134] [2025-03-08 02:11:09,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:09,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-08 02:11:09,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-08 02:11:09,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:09,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-08 02:11:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383134134] [2025-03-08 02:11:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383134134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:09,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383412532] [2025-03-08 02:11:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:09,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:09,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:09,561 INFO L87 Difference]: Start difference. First operand 57601 states and 64364 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:10,984 INFO L93 Difference]: Finished difference Result 122858 states and 137083 transitions. [2025-03-08 02:11:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 595 [2025-03-08 02:11:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:11,045 INFO L225 Difference]: With dead ends: 122858 [2025-03-08 02:11:11,045 INFO L226 Difference]: Without dead ends: 62269 [2025-03-08 02:11:11,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:11,076 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 495 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:11,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 716 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62269 states. [2025-03-08 02:11:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62269 to 60558. [2025-03-08 02:11:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60558 states, 60557 states have (on average 1.096537146820351) internal successors, (66403), 60557 states have internal predecessors, (66403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60558 states to 60558 states and 66403 transitions. [2025-03-08 02:11:11,779 INFO L78 Accepts]: Start accepts. Automaton has 60558 states and 66403 transitions. Word has length 595 [2025-03-08 02:11:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:11,780 INFO L471 AbstractCegarLoop]: Abstraction has 60558 states and 66403 transitions. [2025-03-08 02:11:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60558 states and 66403 transitions. [2025-03-08 02:11:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-03-08 02:11:11,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:11,795 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:11:11,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:11:11,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:11,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1447317063, now seen corresponding path program 1 times [2025-03-08 02:11:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:11,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712842053] [2025-03-08 02:11:11,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:11,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-03-08 02:11:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-03-08 02:11:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:11:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712842053] [2025-03-08 02:11:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712842053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975824989] [2025-03-08 02:11:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:12,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:12,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:12,214 INFO L87 Difference]: Start difference. First operand 60558 states and 66403 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:13,496 INFO L93 Difference]: Finished difference Result 118982 states and 130446 transitions. [2025-03-08 02:11:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 619 [2025-03-08 02:11:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:13,562 INFO L225 Difference]: With dead ends: 118982 [2025-03-08 02:11:13,562 INFO L226 Difference]: Without dead ends: 58426 [2025-03-08 02:11:13,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:13,602 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 443 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:13,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 705 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:11:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58426 states. [2025-03-08 02:11:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58426 to 56297. [2025-03-08 02:11:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56297 states, 56296 states have (on average 1.0736464402444224) internal successors, (60442), 56296 states have internal predecessors, (60442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56297 states to 56297 states and 60442 transitions. [2025-03-08 02:11:14,348 INFO L78 Accepts]: Start accepts. Automaton has 56297 states and 60442 transitions. Word has length 619 [2025-03-08 02:11:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:14,349 INFO L471 AbstractCegarLoop]: Abstraction has 56297 states and 60442 transitions. [2025-03-08 02:11:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 56297 states and 60442 transitions. [2025-03-08 02:11:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-08 02:11:14,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:14,376 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:14,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:11:14,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2130845383, now seen corresponding path program 1 times [2025-03-08 02:11:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304490849] [2025-03-08 02:11:14,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:14,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-08 02:11:14,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-08 02:11:14,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-08 02:11:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304490849] [2025-03-08 02:11:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304490849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:14,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685659954] [2025-03-08 02:11:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:14,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:14,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:14,705 INFO L87 Difference]: Start difference. First operand 56297 states and 60442 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:16,109 INFO L93 Difference]: Finished difference Result 121099 states and 129917 transitions. [2025-03-08 02:11:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:16,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 709 [2025-03-08 02:11:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:16,178 INFO L225 Difference]: With dead ends: 121099 [2025-03-08 02:11:16,178 INFO L226 Difference]: Without dead ends: 64804 [2025-03-08 02:11:16,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:16,207 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 442 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:16,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 377 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64804 states. [2025-03-08 02:11:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64804 to 62672. [2025-03-08 02:11:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62672 states, 62671 states have (on average 1.0706866014584098) internal successors, (67101), 62671 states have internal predecessors, (67101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62672 states to 62672 states and 67101 transitions. [2025-03-08 02:11:16,882 INFO L78 Accepts]: Start accepts. Automaton has 62672 states and 67101 transitions. Word has length 709 [2025-03-08 02:11:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:16,882 INFO L471 AbstractCegarLoop]: Abstraction has 62672 states and 67101 transitions. [2025-03-08 02:11:16,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 62672 states and 67101 transitions. [2025-03-08 02:11:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-03-08 02:11:16,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:16,903 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:11:16,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1618959852, now seen corresponding path program 1 times [2025-03-08 02:11:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097507937] [2025-03-08 02:11:16,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:16,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-03-08 02:11:16,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-03-08 02:11:16,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:16,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 618 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:11:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097507937] [2025-03-08 02:11:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097507937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:17,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939204499] [2025-03-08 02:11:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:17,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:17,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:17,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:17,400 INFO L87 Difference]: Start difference. First operand 62672 states and 67101 transitions. Second operand has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:19,416 INFO L93 Difference]: Finished difference Result 145788 states and 155878 transitions. [2025-03-08 02:11:19,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:19,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 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 735 [2025-03-08 02:11:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:19,637 INFO L225 Difference]: With dead ends: 145788 [2025-03-08 02:11:19,637 INFO L226 Difference]: Without dead ends: 81418 [2025-03-08 02:11:19,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:19,667 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 642 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:19,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 196 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:11:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81418 states. [2025-03-08 02:11:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81418 to 73305. [2025-03-08 02:11:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73305 states, 73304 states have (on average 1.0696551347811851) internal successors, (78410), 73304 states have internal predecessors, (78410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73305 states to 73305 states and 78410 transitions. [2025-03-08 02:11:20,838 INFO L78 Accepts]: Start accepts. Automaton has 73305 states and 78410 transitions. Word has length 735 [2025-03-08 02:11:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:20,839 INFO L471 AbstractCegarLoop]: Abstraction has 73305 states and 78410 transitions. [2025-03-08 02:11:20,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 73305 states and 78410 transitions. [2025-03-08 02:11:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2025-03-08 02:11:20,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:20,868 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:20,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:11:20,869 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:20,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:20,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1078302388, now seen corresponding path program 1 times [2025-03-08 02:11:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:20,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752146901] [2025-03-08 02:11:20,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:20,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:20,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes. [2025-03-08 02:11:20,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements. [2025-03-08 02:11:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2025-03-08 02:11:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:21,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752146901] [2025-03-08 02:11:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752146901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524651369] [2025-03-08 02:11:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:21,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:21,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:21,249 INFO L87 Difference]: Start difference. First operand 73305 states and 78410 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:22,446 INFO L93 Difference]: Finished difference Result 145310 states and 155203 transitions. [2025-03-08 02:11:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:22,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 786 [2025-03-08 02:11:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:22,518 INFO L225 Difference]: With dead ends: 145310 [2025-03-08 02:11:22,518 INFO L226 Difference]: Without dead ends: 69877 [2025-03-08 02:11:22,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:22,560 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 455 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:22,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 728 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:11:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69877 states. [2025-03-08 02:11:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69877 to 67748. [2025-03-08 02:11:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67748 states, 67747 states have (on average 1.0606816538001682) internal successors, (71858), 67747 states have internal predecessors, (71858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67748 states to 67748 states and 71858 transitions. [2025-03-08 02:11:23,227 INFO L78 Accepts]: Start accepts. Automaton has 67748 states and 71858 transitions. Word has length 786 [2025-03-08 02:11:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 67748 states and 71858 transitions. [2025-03-08 02:11:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 67748 states and 71858 transitions. [2025-03-08 02:11:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2025-03-08 02:11:23,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:23,254 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:23,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:11:23,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1439925697, now seen corresponding path program 1 times [2025-03-08 02:11:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550480105] [2025-03-08 02:11:23,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:23,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 865 statements into 1 equivalence classes. [2025-03-08 02:11:23,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 865 of 865 statements. [2025-03-08 02:11:23,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:23,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 1028 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 02:11:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550480105] [2025-03-08 02:11:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550480105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:24,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485226694] [2025-03-08 02:11:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:24,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:24,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:24,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:24,171 INFO L87 Difference]: Start difference. First operand 67748 states and 71858 transitions. Second operand has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:26,082 INFO L93 Difference]: Finished difference Result 157247 states and 167405 transitions. [2025-03-08 02:11:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 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 865 [2025-03-08 02:11:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:26,185 INFO L225 Difference]: With dead ends: 157247 [2025-03-08 02:11:26,185 INFO L226 Difference]: Without dead ends: 89926 [2025-03-08 02:11:26,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:26,234 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 753 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:26,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 158 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:11:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89926 states. [2025-03-08 02:11:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89926 to 84811. [2025-03-08 02:11:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84811 states, 84810 states have (on average 1.0675863695318948) internal successors, (90542), 84810 states have internal predecessors, (90542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84811 states to 84811 states and 90542 transitions. [2025-03-08 02:11:27,387 INFO L78 Accepts]: Start accepts. Automaton has 84811 states and 90542 transitions. Word has length 865 [2025-03-08 02:11:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 84811 states and 90542 transitions. [2025-03-08 02:11:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 84811 states and 90542 transitions. [2025-03-08 02:11:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2025-03-08 02:11:27,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:27,449 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:27,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:11:27,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2023912935, now seen corresponding path program 1 times [2025-03-08 02:11:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:27,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797053590] [2025-03-08 02:11:27,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:27,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 970 statements into 1 equivalence classes. [2025-03-08 02:11:27,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 970 of 970 statements. [2025-03-08 02:11:27,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:27,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1828 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-03-08 02:11:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797053590] [2025-03-08 02:11:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797053590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:27,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:27,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:11:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157412010] [2025-03-08 02:11:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:27,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:27,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:27,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:27,956 INFO L87 Difference]: Start difference. First operand 84811 states and 90542 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:28,815 INFO L93 Difference]: Finished difference Result 150428 states and 160504 transitions. [2025-03-08 02:11:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 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 970 [2025-03-08 02:11:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:28,885 INFO L225 Difference]: With dead ends: 150428 [2025-03-08 02:11:28,885 INFO L226 Difference]: Without dead ends: 66043 [2025-03-08 02:11:28,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:28,931 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 554 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:28,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 69 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:11:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66043 states. [2025-03-08 02:11:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66043 to 65615. [2025-03-08 02:11:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65615 states, 65614 states have (on average 1.0654433505044656) internal successors, (69908), 65614 states have internal predecessors, (69908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65615 states to 65615 states and 69908 transitions. [2025-03-08 02:11:29,772 INFO L78 Accepts]: Start accepts. Automaton has 65615 states and 69908 transitions. Word has length 970 [2025-03-08 02:11:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 65615 states and 69908 transitions. [2025-03-08 02:11:29,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 65615 states and 69908 transitions. [2025-03-08 02:11:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2025-03-08 02:11:29,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:29,822 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:11:29,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:29,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash -157874911, now seen corresponding path program 1 times [2025-03-08 02:11:29,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782887041] [2025-03-08 02:11:29,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:29,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 999 statements into 1 equivalence classes. [2025-03-08 02:11:30,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 999 of 999 statements. [2025-03-08 02:11:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:30,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 1327 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-08 02:11:30,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782887041] [2025-03-08 02:11:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782887041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541632110] [2025-03-08 02:11:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:30,654 INFO L87 Difference]: Start difference. First operand 65615 states and 69908 transitions. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:32,770 INFO L93 Difference]: Finished difference Result 141441 states and 150713 transitions. [2025-03-08 02:11:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 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 999 [2025-03-08 02:11:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:32,862 INFO L225 Difference]: With dead ends: 141441 [2025-03-08 02:11:32,862 INFO L226 Difference]: Without dead ends: 76253 [2025-03-08 02:11:32,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:32,909 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 605 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:32,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 282 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:11:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76253 states. [2025-03-08 02:11:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76253 to 69444. [2025-03-08 02:11:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69444 states, 69443 states have (on average 1.0593292340480682) internal successors, (73563), 69443 states have internal predecessors, (73563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69444 states to 69444 states and 73563 transitions. [2025-03-08 02:11:33,565 INFO L78 Accepts]: Start accepts. Automaton has 69444 states and 73563 transitions. Word has length 999 [2025-03-08 02:11:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:33,566 INFO L471 AbstractCegarLoop]: Abstraction has 69444 states and 73563 transitions. [2025-03-08 02:11:33,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 69444 states and 73563 transitions. [2025-03-08 02:11:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2025-03-08 02:11:33,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:33,601 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:33,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:11:33,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:33,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash 779462945, now seen corresponding path program 1 times [2025-03-08 02:11:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:33,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703307066] [2025-03-08 02:11:33,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:33,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes. [2025-03-08 02:11:33,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements. [2025-03-08 02:11:33,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:33,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1597 backedges. 1278 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-08 02:11:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:34,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703307066] [2025-03-08 02:11:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703307066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:34,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:34,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11835590] [2025-03-08 02:11:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:34,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:34,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:34,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:34,046 INFO L87 Difference]: Start difference. First operand 69444 states and 73563 transitions. Second operand has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 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-03-08 02:11:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:35,977 INFO L93 Difference]: Finished difference Result 157596 states and 166617 transitions. [2025-03-08 02:11:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:35,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 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 1072 [2025-03-08 02:11:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:36,067 INFO L225 Difference]: With dead ends: 157596 [2025-03-08 02:11:36,067 INFO L226 Difference]: Without dead ends: 87302 [2025-03-08 02:11:36,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:36,101 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 617 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:36,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 634 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:11:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87302 states. [2025-03-08 02:11:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87302 to 68589. [2025-03-08 02:11:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68589 states, 68588 states have (on average 1.0567883594797924) internal successors, (72483), 68588 states have internal predecessors, (72483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68589 states to 68589 states and 72483 transitions. [2025-03-08 02:11:36,787 INFO L78 Accepts]: Start accepts. Automaton has 68589 states and 72483 transitions. Word has length 1072 [2025-03-08 02:11:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:36,787 INFO L471 AbstractCegarLoop]: Abstraction has 68589 states and 72483 transitions. [2025-03-08 02:11:36,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 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-03-08 02:11:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 68589 states and 72483 transitions. [2025-03-08 02:11:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2025-03-08 02:11:36,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:36,820 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:36,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:11:36,821 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash 746124374, now seen corresponding path program 1 times [2025-03-08 02:11:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554635898] [2025-03-08 02:11:36,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:36,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1079 statements into 1 equivalence classes. [2025-03-08 02:11:36,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1079 of 1079 statements. [2025-03-08 02:11:36,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:36,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1599 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-08 02:11:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554635898] [2025-03-08 02:11:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554635898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:37,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:37,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649361619] [2025-03-08 02:11:37,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:37,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:37,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:37,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:37,689 INFO L87 Difference]: Start difference. First operand 68589 states and 72483 transitions. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:38,903 INFO L93 Difference]: Finished difference Result 138880 states and 146736 transitions. [2025-03-08 02:11:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:38,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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 1079 [2025-03-08 02:11:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:38,972 INFO L225 Difference]: With dead ends: 138880 [2025-03-08 02:11:38,972 INFO L226 Difference]: Without dead ends: 70718 [2025-03-08 02:11:38,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:38,988 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 113 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:38,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 714 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:11:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70718 states. [2025-03-08 02:11:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70718 to 68590. [2025-03-08 02:11:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68590 states, 68589 states have (on average 1.0558835964950648) internal successors, (72422), 68589 states have internal predecessors, (72422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68590 states to 68590 states and 72422 transitions. [2025-03-08 02:11:39,615 INFO L78 Accepts]: Start accepts. Automaton has 68590 states and 72422 transitions. Word has length 1079 [2025-03-08 02:11:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 68590 states and 72422 transitions. [2025-03-08 02:11:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 68590 states and 72422 transitions. [2025-03-08 02:11:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1233 [2025-03-08 02:11:39,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:39,657 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:39,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:11:39,658 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1927399194, now seen corresponding path program 1 times [2025-03-08 02:11:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374748328] [2025-03-08 02:11:39,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:39,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:39,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1232 statements into 1 equivalence classes. [2025-03-08 02:11:39,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1232 of 1232 statements. [2025-03-08 02:11:39,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:39,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 1233 proven. 0 refuted. 0 times theorem prover too weak. 1041 trivial. 0 not checked. [2025-03-08 02:11:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:40,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374748328] [2025-03-08 02:11:40,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374748328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714842379] [2025-03-08 02:11:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:40,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:40,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:40,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:40,432 INFO L87 Difference]: Start difference. First operand 68590 states and 72422 transitions. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:41,815 INFO L93 Difference]: Finished difference Result 142300 states and 150225 transitions. [2025-03-08 02:11:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:41,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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 1232 [2025-03-08 02:11:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:41,909 INFO L225 Difference]: With dead ends: 142300 [2025-03-08 02:11:41,910 INFO L226 Difference]: Without dead ends: 74137 [2025-03-08 02:11:41,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:41,959 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 402 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:41,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 218 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:11:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74137 states. [2025-03-08 02:11:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74137 to 70719. [2025-03-08 02:11:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70719 states, 70718 states have (on average 1.054512288243446) internal successors, (74573), 70718 states have internal predecessors, (74573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70719 states to 70719 states and 74573 transitions. [2025-03-08 02:11:42,875 INFO L78 Accepts]: Start accepts. Automaton has 70719 states and 74573 transitions. Word has length 1232 [2025-03-08 02:11:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 70719 states and 74573 transitions. [2025-03-08 02:11:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 70719 states and 74573 transitions. [2025-03-08 02:11:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1297 [2025-03-08 02:11:42,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:42,918 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:11:42,918 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:42,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1751823372, now seen corresponding path program 1 times [2025-03-08 02:11:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411149548] [2025-03-08 02:11:42,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:42,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes. [2025-03-08 02:11:43,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements. [2025-03-08 02:11:43,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 2171 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-08 02:11:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411149548] [2025-03-08 02:11:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411149548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:11:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084400076] [2025-03-08 02:11:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:11:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:43,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:11:43,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:43,633 INFO L87 Difference]: Start difference. First operand 70719 states and 74573 transitions. Second operand has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:45,802 INFO L93 Difference]: Finished difference Result 169548 states and 178566 transitions. [2025-03-08 02:11:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:11:45,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 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 1296 [2025-03-08 02:11:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:45,906 INFO L225 Difference]: With dead ends: 169548 [2025-03-08 02:11:45,906 INFO L226 Difference]: Without dead ends: 99256 [2025-03-08 02:11:45,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:45,959 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 915 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:45,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 137 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:11:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99256 states. [2025-03-08 02:11:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99256 to 91594. [2025-03-08 02:11:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91594 states, 91593 states have (on average 1.050167589226251) internal successors, (96188), 91593 states have internal predecessors, (96188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91594 states to 91594 states and 96188 transitions. [2025-03-08 02:11:46,918 INFO L78 Accepts]: Start accepts. Automaton has 91594 states and 96188 transitions. Word has length 1296 [2025-03-08 02:11:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:46,919 INFO L471 AbstractCegarLoop]: Abstraction has 91594 states and 96188 transitions. [2025-03-08 02:11:46,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 91594 states and 96188 transitions. [2025-03-08 02:11:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1484 [2025-03-08 02:11:47,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:47,002 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:47,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:11:47,002 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:47,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1694804240, now seen corresponding path program 1 times [2025-03-08 02:11:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221020415] [2025-03-08 02:11:47,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:47,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1483 statements into 1 equivalence classes. [2025-03-08 02:11:47,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1483 of 1483 statements. [2025-03-08 02:11:47,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:47,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3379 backedges. 2115 proven. 0 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2025-03-08 02:11:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221020415] [2025-03-08 02:11:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221020415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:47,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:47,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:47,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543610015] [2025-03-08 02:11:47,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:47,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:47,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:47,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:47,818 INFO L87 Difference]: Start difference. First operand 91594 states and 96188 transitions. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:49,522 INFO L93 Difference]: Finished difference Result 190878 states and 200413 transitions. [2025-03-08 02:11:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 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 1483 [2025-03-08 02:11:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:49,620 INFO L225 Difference]: With dead ends: 190878 [2025-03-08 02:11:49,620 INFO L226 Difference]: Without dead ends: 99711 [2025-03-08 02:11:49,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:49,667 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 794 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:49,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 189 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:11:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99711 states. [2025-03-08 02:11:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99711 to 85642. [2025-03-08 02:11:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85642 states, 85641 states have (on average 1.0488784577480412) internal successors, (89827), 85641 states have internal predecessors, (89827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85642 states to 85642 states and 89827 transitions. [2025-03-08 02:11:50,483 INFO L78 Accepts]: Start accepts. Automaton has 85642 states and 89827 transitions. Word has length 1483 [2025-03-08 02:11:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:50,483 INFO L471 AbstractCegarLoop]: Abstraction has 85642 states and 89827 transitions. [2025-03-08 02:11:50,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 85642 states and 89827 transitions. [2025-03-08 02:11:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1490 [2025-03-08 02:11:50,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:50,536 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:11:50,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:11:50,536 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:50,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash -263349652, now seen corresponding path program 1 times [2025-03-08 02:11:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:50,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744278677] [2025-03-08 02:11:50,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:50,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1489 statements into 1 equivalence classes. [2025-03-08 02:11:50,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1489 of 1489 statements. [2025-03-08 02:11:50,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:50,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3407 backedges. 2137 proven. 0 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2025-03-08 02:11:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744278677] [2025-03-08 02:11:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744278677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:51,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292448967] [2025-03-08 02:11:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:51,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:51,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:51,142 INFO L87 Difference]: Start difference. First operand 85642 states and 89827 transitions. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:52,789 INFO L93 Difference]: Finished difference Result 180252 states and 188950 transitions. [2025-03-08 02:11:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 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 1489 [2025-03-08 02:11:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:52,878 INFO L225 Difference]: With dead ends: 180252 [2025-03-08 02:11:52,878 INFO L226 Difference]: Without dead ends: 95037 [2025-03-08 02:11:52,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:52,928 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 814 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:52,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 175 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95037 states. [2025-03-08 02:11:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95037 to 85217. [2025-03-08 02:11:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85217 states, 85216 states have (on average 1.048382932782576) internal successors, (89339), 85216 states have internal predecessors, (89339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85217 states to 85217 states and 89339 transitions. [2025-03-08 02:11:53,707 INFO L78 Accepts]: Start accepts. Automaton has 85217 states and 89339 transitions. Word has length 1489 [2025-03-08 02:11:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:53,707 INFO L471 AbstractCegarLoop]: Abstraction has 85217 states and 89339 transitions. [2025-03-08 02:11:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 85217 states and 89339 transitions. [2025-03-08 02:11:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1492 [2025-03-08 02:11:53,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:53,759 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:53,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 02:11:53,759 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 335097657, now seen corresponding path program 1 times [2025-03-08 02:11:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700269922] [2025-03-08 02:11:53,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:53,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-08 02:11:53,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-08 02:11:53,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:53,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3247 backedges. 1917 proven. 300 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-08 02:11:55,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700269922] [2025-03-08 02:11:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700269922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:11:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951565142] [2025-03-08 02:11:55,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:55,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:11:55,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:11:55,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:11:55,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:11:55,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-08 02:11:55,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-08 02:11:55,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:55,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:55,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:11:55,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:11:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3247 backedges. 976 proven. 82 refuted. 0 times theorem prover too weak. 2189 trivial. 0 not checked. [2025-03-08 02:11:56,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:11:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3247 backedges. 976 proven. 82 refuted. 0 times theorem prover too weak. 2189 trivial. 0 not checked. [2025-03-08 02:11:56,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951565142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:11:56,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:11:56,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:11:56,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117171764] [2025-03-08 02:11:56,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:11:56,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:11:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:56,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:11:56,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:11:56,780 INFO L87 Difference]: Start difference. First operand 85217 states and 89339 transitions. Second operand has 10 states, 10 states have (on average 157.6) internal successors, (1576), 9 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)